Elliptic curve encryption processing method, elliptic curve encryption processing apparatus, and program

ABSTRACT

An elliptic curve encryption processing method and an elliptic curve encryption processing apparatus enable high-speed elliptic curve encryption processing computations to be realized. In elliptic curve encryption processing computations, two scalar multiplications, kP and lQ, are not performed separately, but the computation process of kP+lQ is performed simultaneously. In the computation of scalar multiplications, kP and lQ are set on a Montgomery elliptic curve By 2 =x 3 +Ax 2 +x. On the basis of a combination of each bit value of k and l from the high-order bits of the binary representation data of the scalar quantities k and l, a computation relation of the next four points based on the computed four points is selected, and based on the selected relation, a process of computing the next four points is repeatedly performed to eventually compute kP+lQ.

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] The present application claims priority from Japanese Application No. 2001-126024 filed Apr. 24, 2001, the disclosure of which is hereby incorporated by reference herein.

BACKGROUND OF THE INVENTION

[0002] The present invention relates to an elliptic curve encryption processing method, an elliptic curve encryption processing apparatus, and a program for realizing high-speed elliptic curve encryption.

[0003] Recently, with advances in network communication and electronic commerce, security protection in communication has become an important issue. One method of security protection is encryption technology and, at present, communications using various encryption techniques are performed in practice.

[0004] The encryption methods are broadly classified into common key methods and public key methods. The common key methods are also called “symmetrical encryption methods”, in which both the originator and the receiver hold a common key. As a representative method of the common key method, there is DES (Data Encryption Standard). The features of the DES algorithm are that encryption and decryption can be performed using substantially the same algorithm.

[0005] In contrast to this common key encryption, a construction in which the keys of the originator and the receiver are different is a public key method or an asymmetrical encryption method. In the public key encryption method, unlike the common key encryption method which uses a common key for encryption and decryption, a secret key which must be kept secret needs only to be possessed by one specific person. Therefore, the public key encryption method is advantageous in managing keys. However, since the data processing speed of the public key encryption method, is generally slower than that of the common key encryption method, the public key encryption method is often used for objects with a small amount of data, such as the distribution of the secret key or a digital signature. RSA (Rivest-Shamir-Adleman) encryption is a representative example of the public key encryption method. RSA uses a product of two very large prime numbers (for example, 150 digits), and the difficulty of factorizing the product of two large prime numbers (for example, 150 digits) into prime numbers is used.

[0006] The public key encryption method has a construction in which a public key can be used for an unspecified number of the general public and in which a method of using a certificate, which certifies whether or not the public key to be distributed is valid, that is, a so-called public key certificate, is often used. For example, a user A generates a public key and secret key pair, sends the generated public key to a certificate authority, and obtains a public key certificate from the certificate authority. The user A makes the public key certificate public. An unspecified user obtains the public key from the public key certificate after undergoing a predetermined procedure, encrypts a document, etc., and sends it to the user A. The user A is a system in which the encrypted document, etc., is decrypted using the secret key. Furthermore, the user A is a system in which a signature is attached to a document, etc., by using the secret key, an unspecified user obtains the public key from the public key certificate after undergoing a predetermined procedure, and the verification of the signature is performed.

[0007] The public key certificate is a certificate which is issued by the certificate authority (CA) or the issuer authority (IA) in the public key encryption method, and is also a certificate which is created such that, as a result of a user submitting a user ID, the public key, etc., to the certificate authority, the certificate authority adds information, such as the ID of the certificate authority and the period of validity, and furthermore, the signature of the certificate authority is added.

[0008] As the public key encryption method, in addition to the above-described RSA method, discrete logarithm encryption, which uses the difficulty of the discrete logarithm problem in a case where n is a prime number, is known. This discrete logarithm encryption is used for the DSA (Digital Signature Standard), which is a known digital signature standard in the United States. Furthermore, the elliptic curve cryptography (ECC), which was proposed by V. Miller and N. Koblitz, has recently attracted attention due to its security and high speed. Elliptic curve cryptography using a 160-bit key is said to have a strength comparable to a 1024-bit key in RSA.

[0009] Generally, elliptic curve cryptography uses an elliptic curve represented by y²=x³+ax+b (4a³+27b²≢0) on a prime field and an elliptic curve represented by y²+xy=x³ +ax²+b (b≢0) on two extension fields. A set in which a point at infinity (O) is added to the points on these curves forms a finite group with respect to addition, and the point at infinity (O) becomes the identity element thereof. Hereafter, addition of points on this finite group is indicated by “+”. The addition P+Q of two different points P and Q on this finite group is called “addition of points”, and the addition P+P=2P of a point P and a point P is called “double addition of points”. Furthermore, the computation for determining the points P+P+ . . . +P=kP, in which the point P is added k times, is called “scalar multiplication of points”.

[0010] It is known that the scalar multiplication of points can be formed by using addition of points and double addition of points. The addition method of points, the double addition method of points, and the scalar multiplication of points on the affine coordinate system (x, y) and the projective coordinates (X, Y, Z) on an elliptic curve on a prime field and on elliptic curves on two extension fields are described in “IEEE P1363/D13 Standard Specification for Public Key Cryptography”.

[0011] Furthermore, a method (P. Montgomery, “Speeding the Pollard and Elliptic Curve Method of Factorization”, Mathematics of Computation, Vol. 48, No. 177, pp. 243-264 (1987)) of performing at high speed the scalar multiplication of points by using a Montgomery elliptic curve represented by By²=x³+Ax²+x ((A²−4)B≢0) on a prime field, which was introduced to perform factorization into prime numbers, has been proposed. Hereafter, this technique is called the “Montgomery method on an elliptic curve on a prime field”.

[0012] According to this method, in the affine coordinate system, when the addition point of two different points P₀(x₀, y₀) and P₁(x₁, y₁) is denoted as point P₂=P₁+P₀, if P₃(x₃, y₃)=P₁(x₁, y₁)−P₀(x₀, y₀) is known, then x₂ can be determined on the basis of:

X ₂=(x ₀ X ₁−1)² /x ₃(x ₀ x ₁)²)

[0013] Furthermore, when the point of double addition of the point P₀(x₀, y₀) is denoted as point P₂(x₂, Y₂)=2P₀, then x₂ can be determined on the basis of:

x ₂=(x ₀ ²−1)²/(4x ₀(x ₂ ² +Ax ₀+1))

[0014] In this manner, the addition method of points and the double addition method of points can be formed without using the y coordinate.

[0015] Here, in general, since division on a prime field has a higher calculation cost compared to multiplication on a prime field, when conversion into the projective coordinate system (X, Y, Z) is performed while assuming that x=X/Z and y=Y/Z, the Montgomery elliptic curve becomes:

BY ² Z=X ³ +AX ² Z+XZ ²

[0016] At this time, when the addition point of two different points P₀(X₀, Y₀, Z₀) and P₁(X₁, Y₁, Z₁) is denoted as=P₂(X₂, Y₂, Z₂)=P₁(X₁, Y₁, Z₁)+P₀(X₀, Y₀, Z₀), if P₃ (X₃, Y₃, Z₃)=P₁(X₁, Y₁, Z₁)−P₀(X₀, Y₀, Z₀) is known, then (X₂, Z₂) can be determined on the basis of:

X ₂ =Z ₃ ((X ₀ −Z ₀) (X ₁ +Z ₁)+(X ₀ +Z ₀) (X ₁ −Z ₁)²

Z ₂ =X ₃((X ₀ −Z ₀) (X ₁ +Z ₁)−(X ₀ +Z ₀) (X ₁ −Z ₁))²

[0017] Furthermore, when the point of the double addition of the point P₀(X₀, Y₀, Z₀) is denoted as point P₂(X₂, Y₂, Z₂)=2P₀, then, assuming that C=(A+2)/4, (X₂, Z₂) can be determined on the basis of:

X ₂=(X ₀ +Z ₀)²

Z ₂=((X ₀ +Z ₀)²−(X ₀ −Z ₀)²) ((X ₀ −Z ₀)² +C((X ₀ +Z ₀)²−(X ₀ −Z ₀)²))

[0018] In this manner, the addition method of points and the double addition method of points can be formed without using the Y coordinate.

[0019] In order to form a scalar multiplication kP of points by using the above addition method of points and the double addition method of points in the Montgomery elliptic curve on a prime field, a point which is a difference between two points in the addition of points needs to be known. By taking note of this, the following is performed. The initial two points are denoted as {T0, T1}={P, 2P}, and k is subjected to dyadic expansion. When the bits from the bit next to the highest-order bit to the lowest-order are all 0, {2T0, T0+T1} is determined from {T0, T1} so as to be formed as a new {T0, T1}. When the bits are all 1, {T0+T1, 2T1} is determined from {T0, T1} so as to be formed as a new {T0, T1}. This is repeated. Then, the final TO becomes kP. At this time, T1−T0=P always holds.

[0020] ECDSA (Elliptic Curve Digital Signature Algorithm) is a representative example of an electronic signature method using elliptic curve encryption. In the signature verification process of ECDSA, a calculation for determining the x coordinate of the addition point kP+lQ of scalar multiplication points of two different points is required.

[0021] In order to calculate the x coordinate of kP+lQ using the Montgomery method on an elliptic curve on a prime field, the following is performed. First, kP and lQ are determined by the Montgomery method on an elliptic curve on a prime field in accordance with the above-described technique. Thereafter, the point kP and the point lQ are added together. However, since the point of the difference between two points is not known, the above-described addition method of points cannot be used. For this reason, it is necessary to determine the x coordinate of kP+lQ by using another addition method after the y coordinate or the Y coordinate of each of kP and lQ is recovered.

[0022] Furthermore, a technique (J. Lopez and R. Dahab, “Fast Multiplication on Elliptic Curve over GF(2^(m)) without Precomputation”, Cryptographic Hardware and Embedded Systems, LNCS 1717, pp. 316-327 (1999)) of performing at high speed the scalar multiplication of points by the same technique as for the Montgomery elliptic curve on a prime field on an elliptic curve y²+xy=x³+ax²+b (b≢0) on two extension fields has been proposed. Hereafter, this is called the “Montgomery method on elliptic curves on two extension fields”. Also, in this technique, in order to calculate the x coordinate of kP+lQ, it is necessary to determine the x coordinate of kP+lQ after the y coordinate or the Y coordinate of each of kP and lQ is recovered.

[0023] As described above, in the Montgomery method on an elliptic curve on a prime field and in the Montgomery method on elliptic curves on two extension fields, scalar multiplication of points can be calculated at high speed. However, in the calculation of kP+lQ required when the ECDSA signature is to be created, a process of restoring the y coordinate or the Y coordinate of kP+lQ is required.

SUMMARY OF THE INVENTION

[0024] The present invention has been made in view of the above-described problems with using the Montgomery method on an elliptic curve on a prime field and the Montgomery method on elliptic curves on two extension fields. An object of the present invention is to provide an elliptic curve encryption processing method, an elliptic curve encryption processing apparatus, and a recording medium recorded with a program in which a high-speed elliptic curve encryption process is realized by simultaneously performing the computation process of kP+lQ while calculating four points on an elliptic curve without separately performing two scalar multiplications kP and lQ.

[0025] Another object of the present invention is to provide an elliptic curve encryption processing method, an elliptic curve encryption processing apparatus, and a recording medium recorded with a program in which a high-speed elliptic curve encryption process is realized by simultaneously performing the computation process of kP+lQ while calculating three points on an elliptic curve when the computation process of kP and lQ is performed.

[0026] To achieve the above-mentioned objects, in a first aspect, the present invention provides an elliptic curve encryption processing method using a Montgomery elliptic curve By²=x³+Ax²+x on a prime field, the elliptic curve encryption processing method including, in the computation of an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on the Montgomery elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on the Montgomery elliptic curve, an initial point computation step of calculating a set G_(t+1) of four initial points on the basis of the point P and the point Q; a bit value detection step of detecting a combination of each bit value of k and l of binary representation data of the scalar quantities k and l; and an iterative computation process step of selecting a computation relation of a set G_(t) of the next four points based on the set Gt+l of four initial points according to a combination of each bit value of the binary representation data of k and l detected in the bit value detection step and performing a computation process of the next four points in accordance with the computation relation of the set G_(t), and selecting a computation relation of a set G_(i) of the next four points based on a set G_(i+1) of the four computed points and repeatedly performing a computation process of the next four points according to the number of bits of k or l of the binary representation data in accordance with the computation relation of the set G_(i).

[0027] In one form of the elliptic curve encryption processing method of the present invention, when the high-order bit values of the high orders t to i when each bit of the binary representation data of k and l are k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and ni=(l_(t) . . . l_(i))₂, the set G_(i) of four points is formed of the four points which are indicated in the expressions below by using the point P and the point Q:

m_(i)P+n_(i)Q

m_(i)P+(n_(i)+1)Q

(m_(i)+1)P+n _(i)Q

(m_(i)+1)P+(n_(i)+1)Q, and

[0028] the initial points are set as the four points shown below which are computed on the basis of the expressions on the basis of m_(t+1)=k_(t+) 1=0 and n_(t+1)=l_(t+1)=0 by setting i=t+1:

T ₀ [t+1]=O (point at infinity)

T₁ [t+1]=Q

T ₂ [t+1]=P

T ₃ [t+1]=P+Q.

[0029] Furthermore, in another form of the elliptic curve encryption processing method of the present invention, when the high-order bit values of the high orders t to i when each bit of the binary representation data of k and l is k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o),)₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, the set G_(i) of four points is formed of the four points which are indicated in the expressions below by using the point P and the point Q:

m_(i)P+n_(i)Q

m_(i)P+(n_(i)+1)Q

(m_(i)+1)P+n_(i)Q

(m_(i)+1)P+(n_(i)+1)Q, and

[0030] the iterative computation process step includes computing the set G_(i) of the next four points repeatedly on the basis of the set G_(i+1) of the four computed points in order to eventually compute a set G₀ of four points, and in which one point which is a constituent of the set G₀ of four points is computed as W=kP+lQ.

[0031] In a second aspect, the present invention provides an elliptic curve encryption processing method using a Montgomery elliptic curve By²=x³+Ax²+x on a prime field, the elliptic curve encryption processing method including, in the computation of an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on the Montgomery elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on the Montgomery elliptic curve, a bit value detection step of detecting a combination of each bit value of k and l of binary representation data of the scalar quantities k and l; an initial point computation step of computing a set G′_(t+1) of three initial points on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of the binary representation data of the scalar quantities k and l; and an iterative computation process step of selecting a computation relation of a set G′_(t) of the next three points based on the set G′_(t+1) of three initial points according to a combination of each bit value of the binary representation data of k and l detected in the bit value detection step and performing a computation process of the next three points in accordance with the computation relation of the set G′_(t), and selecting a computation relation of a set G′_(i) of the next three points based on a set G′_(i+1) of the three computed points and repeatedly performing a computation process of the next three points according to the number of bits of k or l of the binary representation data in accordance with the computation relation of the set G′_(i).

[0032] In one form of the elliptic curve encryption processing method of the present invention, when the high-order bit values of the high orders t to i when each bit of the binary representation data of k and l are k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, the set G′_(i) of three points is formed of the three points which are selected on the basis of a combination of the bit value (k_(t−1), l_(t−1)) of k and l of the binary representation data from the following four points indicated in the expression below by using the point P and the point Q:

m_(i)P+n_(i)Q

m_(i)P+(n_(i)+1)Q

(m_(i)+1)P+n_(i)Q

(m_(i)+1)P+(n_(i)+1)Q, and

[0033] the initial points are set as the three points which are selected on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of the binary representation data from the following four points:

T ₀ [t+1]=O (point at infinity)

T ₁ [t+1]=Q

T ₂ [t+1]=P

T ₃ [t+1]=P+A

[0034] which are the four points computed based on the above relations from m_(t+1)=k_(t+1)=0 and nt+l=lt+l=0 by setting i=t+1.

[0035] In another form of the elliptic curve encryption processing method of the present invention, when the high-order bit values of the high orders t to i when each bit of the binary representation data of k and l are k: (k_(t) . . .k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, the set G′_(i) of three points is formed of the three points which are selected on the basis of a combination of the high-order bit value (k_(t), l_(t)) of k and l of the binary representation data indicated in the expressions below by using the point P and the point Q:

m_(i)P+n_(i)Q

m_(i)P+(n_(i)+1)Q

(m_(i)+1)P+n_(i)Q

(m_(i)+1)P+(n_(i)+1)Q, and

[0036] the iterative computation process step includes computing the set G′_(i) of the next three points from the set G∝_(i+1) of the three computed points repeatedly to eventually compute a set G′_(i+1) of three points, and W=kP+lQ is computed from the set G′₁ of three points.

[0037] In a third aspect, the present invention provides an elliptic curve encryption processing method using an elliptic curve y²+xy=x³+ax²+b on two extension fields, the elliptic curve encryption processing method including, in the computation of an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on the elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on the elliptic curve, an initial point computation step of calculating a set G_(t+1) of four initial points on the basis of the point P and the point Q; a bit value detection step of detecting a combination of each bit value of k and l of binary representation data of the scalar quantities k and l; and an iterative computation process step of selecting a computation relation of a set Gt of the next four points based on the set G_(t+1) of four initial points according to a combination of each bit value of the binary representation data of k and l detected in the bit value detection step and performing a computation process of the next four points in accordance with the computation relation of the set G_(t), and selecting a computation relation of a set G_(i) of the next four points based on a set G_(i+1) of the four computed points and repeatedly performing a computation process of the next four points according to the number of bits of k or l of the binary representation data in accordance with the computation relation of the set G_(i).

[0038] In one form of the elliptic curve encryption processing method of the present invention, when the high-order bit values of the high orders t to i when each bit of the binary representation data of k and l are k: (k_(t) . . .k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, the set G_(i) of four points is formed of the four points which are indicated in the expressions below by using the point P and the point Q:

m_(i)P+n_(i)Q

m_(i)P+(n_(i)+1)Q

(m_(i)+1)P+n_(i)Q

(m_(i)+1)P+(n_(i)+1)Q, and

[0039] the initial points are set as the four points shown below which are computed on the basis of the expressions on the basis of m_(t+1)=k_(t+1)=0 and n_(t+1)=l_(t+1)=0 by setting i=t+1:

T ₀ [t+1]=O (point at infinity)

T ₁ [t+1]=Q

T ₂ [t+1]=P

T ₃ [t+1]=P+Q.

[0040] In another form of the elliptic curve encryption processing method of the present invention, when the high-order bit values of the high orders t to i when each bit of the binary representation data of k and l is k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, the set G_(i) of four points is formed of the four points which are indicated in the expressions below by using the point P and the point Q:

m_(i)P+n_(i)Q

m_(i)P+(n_(i)+1)Q

(m_(i)+1)P+n_(i)Q

(m_(i)+1)P+(n_(i)+1)Q, and

[0041] the iterative computation process step includes computing the set G_(i) of the next four points repeatedly on the basis of the set G_(i+1) of the four computed points in order to eventually compute a set G₀ of four points, and in which one point which is a constituent of the set G₀ of four points is computed as W=kP+lQ.

[0042] In a fourth aspect, the present invention provides an elliptic curve encryption processing method using an elliptic curve y²+xy=X³+ax²+b on two extension fields, the elliptic curve encryption processing method including, in the computation of an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on the elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on the elliptic curve, a bit value detection step of detecting a combination of each bit value of k and l of binary representation data of the scalar quantities k and l; an initial point computation step of computing a set G′_(t+1) of three initial points on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of the binary representation data of the scalar quantities k and l by using the point P and the point Q; and an iterative computation process step of selecting a computation relation of a set G′_(t) of the next three points based on the set G′_(t+1) of three initial points according to a combination of each bit value of the binary representation data of k and l detected in the bit value detection step and performing a computation process of the next three points in accordance with the computation relation of the set G′_(t), and selecting a computation relation of a set G′_(i) of the next three points based on a set G′_(i+1) of the three computed points and repeatedly performing a computation process of the next three points according to the number of bits of k or l of the binary representation data in accordance with the computation relation of the set G′_(i).

[0043] In one form of the elliptic curve encryption processing method of the present invention, when the high-order bit values of the high orders t to i when each bit of the binary representation data of k and l are k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, the set G+_(i) of three points is formed of the three points which are selected on the basis of a combination of the bit values (k_(i−1), l_(i−1)) of k and l of the binary representation data from the four points indicated in the expressions below by using the point P and the point Q:

m_(i)P+n_(i)Q

m_(i)P+(n_(i)+1)Q

(m_(i+)1) P+n_(i)Q

(m_(i)+1)P+(n_(i)+1)Q, and

[0044] the initial points are set as the three points which are selected on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of the binary representation data from the four points shown below which are computed on the basis of the above expressions on the basis of m_(t+1)=k_(t+1)=0 and n_(t+1)=l_(t+1)=0 by setting i=t+1:

T ₀ [t+1]=O (point at infinity)

T ₀ [t+1]=Q

T ₂ [t+1]=P

T ₃ [t+1]=P+Q.

[0045] In another form of the elliptic curve encryption processing method of the present invention, when the high-order bit values of the high orders t to i when each bit of the binary representation data of k and l is k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, the set G′_(i) of three points is formed of the three points which are selected on the basis of a combination of the bit values (k_(i−1), l_(i−1)) of k and l of the binary representation data from the four points indicated in the expressions below by using the point P and the point Q:

m_(i)P+n_(i)Q

m_(i)P+(n_(i)+1)Q

(m_(i)+1)P+n_(i)Q

(m_(i)+1)P+(n_(i)+1)Q, and

[0046] the iterative computation process step includes computing the set G′_(i) of the next three points on the basis of the set G′_(i+1) of the three computed points repeatedly to eventually compute a set G′₁ of three points, and in which W=kP+lQ is computed from the set G′₁ of three points.

[0047] In a fifth aspect, the present invention provides an elliptic curve encryption processing apparatus using a Montgomery elliptic curve By²=x³+Ax²+x on a prime field, the elliptic curve encryption processing apparatus including a computation processor operable to compute an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on the Montgomery elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on the Montgomery elliptic curve, wherein the computation processor performs: an initial point computation process of calculating a set G_(t+1) of four initial points on the basis of the point P and the point Q; a bit value detection process of detecting a combination of each bit value of k and l of binary representation data of the scalar quantities k and l; and an iterative computation process of selecting a computation relation of a set G_(t) of the next four points based on the set G_(t+1) of four initial points according to a combination of each bit value of the binary representation data of k and l detected in the bit value detection process and performing a computation process of the next four points in accordance with the computation relation of the set G_(t), and selecting a computation relation of a set G_(i) of the next four points based on a set G_(i+1) of the four computed points and repeatedly performing a computation process of the next four points according to the number of bits of k or l of the binary representation data in accordance with the computation relation of the set G_(i).

[0048] In one form of the elliptic curve encryption processing apparatus of the present invention, when the high-order bit values of the high orders t to i when each bit of the binary representation data of k and l are k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, the set G_(i) of four points is formed of the four points which are indicated in the expressions below by using the point P and the point Q:

m_(i)P+n_(i)Q

m_(i)P+(n_(i)+1)Q

(m_(i)+1) P+n_(i)Q

(m_(i)+1)P+(n_(i)+1)Q, and

[0049] the initial points are set as the four points shown below which are computed on the basis of the expressions on the basis of m_(t+1)=k_(t+1)=0 and n_(t+1)=l_(t+1)=0 by setting i=t+1:

T ₀ [t+1]=O (point at infinity)

T ₁ [t+1]=Q

T ₂ [t+1]=P

T ₃ [t+1]=P+Q.

[0050] In another form of the elliptic curve encryption processing apparatus of the present invention, when the high-order bit values of the high orders t to i when each bit of the binary representation data of k and l is k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, the set G_(i) of four points is formed of the four points which are indicated in the expressions below by using the point P and the point Q:

m_(i)P+n_(i)Q

m_(i)P+(n_(i)+1)Q

(m_(i)+1)P+n_(i)Q

(m_(i)+1)P+(n_(i)+1)Q, and

[0051] the computation processor is operable to compute the set G_(i) of the next four points repeatedly on the basis of the set G_(i+1) of the four computed points in order to eventually compute a set G₀ of four points, and in which one point which is a constituent of the set G₀ of four points is computed as W kP+lQ.

[0052] In a sixth aspect, the present invention provides an elliptic curve encryption processing apparatus using a Montgomery elliptic curve By²=X³+Ax²+x on a prime field, the elliptic curve encryption processing apparatus including a computation processor operable to compute an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on the Montgomery elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on the Montgomery elliptic curve, wherein the computation processor performs: a bit value detection process of detecting a combination of each bit value of k and l of binary representation data of the scalar quantities k and l; an initial point computation process of computing a set G′_(t+1) of three initial points on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of the binary representation data of the scalar quantities k and l; and an iterative computation process of selecting a computation relation of a set G′_(t) of the next three points based on the set G′_(t+1) of three initial points according to a combination of each bit value of the binary representation data of k and l detected in the bit value detection process and performing a computation process of the next three points in accordance with the computation relation of the set G′_(t), and selecting a computation relation of a set G′_(i) of the next three points based on a set G′_(i+1) of the three computed points and repeatedly performing a computation process of the next three points according to the number of bits of k or l of the binary representation data in accordance with the computation relation of the set G′_(i).

[0053] In one form of the elliptic curve encryption processing apparatus of the present invention, when the high-order bit values of the high orders t to i when each bit of the binary representation data of k and l are k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, the set G′_(i) of three points is formed of the three points which are selected on the basis of a combination of the bit value (k_(t−l), l_(t−1)) of k and l of the binary representation data from the following four points indicated in the expression below by using the point P and the point Q:

m_(i)P+niQ

m_(i)P+(ni+1)Q

(mi+1)P+niQ

(mi+1)P+(ni+1)Q, and

[0054] the initial points are set as the three points which are selected on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of the binary representation data from the following four points:

T ₀ [t+1]=O (point at infinity)

T ₁ [t+1]=Q

T ₂ [t+1]=P

T ₃ [t+1]=P+A

[0055] which are the four points computed based on the above relations from m_(t+1)=k_(t+1)=0 and n_(t+1)=l_(t+1)=0 by setting i=t+1.

[0056] In another form of the elliptic curve encryption processing apparatus of the present invention, when the high-order bit values of the high orders t to i when each bit of the binary representation data of k and l are k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and ni=(l_(t) . . . l_(i))₂, the set G′_(i) of three points is formed of the three points which are selected on the basis of a combination of the high-order bit value (k_(t), l_(t)) of k and l of the binary representation data indicated in the expressions below by using the point P and the point Q:

m_(i)P+n_(i)Q

m_(i)P+(n_(i)+1)Q

(m_(i)+1) P+n_(i)Q

(m_(i)+1)P+(n_(i)+1)Q, and

[0057] the computation processor is operable to compute the set G′_(i) of the next three points from the set G′_(i+1) of the three computed points repeatedly to eventually compute a set G′₁ of three points, and in which W=kP+lQ is computed from the set G′₁ of three points.

[0058] In a seventh aspect, the present invention provides an elliptic curve encryption processing apparatus using an elliptic curve y²+Xy=X³+ax²+b on two extension fields, the elliptic curve encryption processing apparatus including a computation processor operable to compute an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on the elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on the elliptic curve, wherein the computation processor performs: an initial point computation process of calculating a set G_(t+1) of four initial points on the basis of the point P and the point Q; a bit value detection process of detecting a combination of each bit value of k and l of binary representation data of the scalar quantities k and l; and an iterative computation process of selecting a computation relation of a set G_(t) of the next four points based on the set G_(t+1) of four initial points according to a combination of each bit value of the binary representation data of k and l detected in the bit value detection process and performing a computation process of the next four points in accordance with the computation relation of the set Gt, and selecting a computation relation of a set G_(i) of the next four points based on a set G_(i+1) of the four computed points and repeatedly performing a computation process of the next four points according to the number of bits of k or l of the binary representation data in accordance with the computation relation of the set G_(i).

[0059] In one form of the elliptic curve encryption processing apparatus of the present invention, when the high-order bit values of the high orders t to i when each bit of the binary representation data of k and l are k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, the set G_(i) of four points is formed of the four points which are indicated in the expressions below by using the point P and the point Q:

m_(i)P+n_(i)Q

m_(i)P+(n_(i)+1)Q

(m_(i)+1)P+n_(i)Q

(m_(i)+1)P+(n_(i)+1)Q, and

[0060] the initial points are set as the four points shown below which are computed on the basis of the expressions on the basis of m_(t+1)=k_(t+1)=0 and n_(t+1)=l_(t+1)=0 by setting i=t+1:

T ₀ [t+1]=O (point at infinity)

T ₁ [t+1]=Q

T ₂ [t+1]=P

T ₃ [t+1]=P+Q.

[0061] In another form of the elliptic curve encryption processing apparatus of the present invention, when the high-order bit values of the high orders t to i when each bit of the binary representation data of k and l is k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . .l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, the set G_(i) of four points is formed of the four points which are indicated in the expressions below by using the point P and the point Q:

m_(i)P+n_(i)Q

m_(i)P+(n_(i)+1)Q

(m_(i)+1)P+n_(i)Q

(m_(i)+1)P+(n_(i)+1)Q, and

[0062] the computation processor is operable to compute the set G_(i) of the next four points repeatedly on the basis of the set G_(i+1) of the four computed points in order to eventually compute a set G₀ of four points, and in which one point which is a constituent of the set Go of four points is computed as W=kP+lQ.

[0063] In an eighth aspect, the present invention provides an elliptic curve encryption processing apparatus using an elliptic curve y²+xy=x³+ax²+b on two extension fields, the elliptic curve encryption processing apparatus including a computation processor operable to compute an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on the elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on the elliptic curve, wherein the computation processor performs: a bit value detection process of detecting a combination of each bit value of k and l of binary representation data of the scalar quantities k and l; an initial point computation process of computing a set G′_(t+1) of three initial points on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of the binary representation data of the scalar quantities k and l by using the point P and the point Q; and an iterative computation process of selecting a computation relation of a set G′_(t) of the next three points based on the set G′_(t+1) of three initial points according to a combination of each bit value of the binary representation data of k and l detected in the bit value detection process and performing a computation process of the next three points in accordance with the computation relation of the set G′_(t), and selecting a computation relation of a set G′_(i) of the next three points based on a set G′_(i+1) of the three computed points and repeatedly performing a computation process of the next three points according to the number of bits of k or l of the binary representation data in accordance with the computation relation of the set G′_(i).

[0064] In one form of the elliptic curve encryption processing apparatus of the present invention, when the high-order bit values of the high orders t to i when each bit of the binary representation data of k and l are k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, the set G′_(i) of three points is formed of the three points which are selected on the basis of a combination of the bit values (k_(i−1), l_(i−1)) of k and l of the binary representation data from the four points indicated in the expressions below by using the point P and the point Q:

m_(i)P+n_(i)Q

m_(i)P+(n_(i)+1)Q

(m_(i)+1)P+n_(i)Q

(m_(i)+1)P+(n_(i)+1)Q, and

[0065] the initial points are set as the three points which are selected on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of the binary representation data from the four points shown below which are computed on the basis of the above expressions on the basis of m_(t+1)=k_(t+1)=0 and n_(t+1)=l_(t+1)=0 by setting i=t+1:

T ₀ [t+1]=O (point at infinity)

T₁ [t+1]=Q

T ₂ [t+1]=P

T ₃ [t+1]=P+Q.

[0066] In another form of the elliptic curve encryption processing apparatus of the present invention, when the high-order bit values of the high orders t to i when each bit of the binary representation data of k and l is k: (k_(t) . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, the set G′_(i) of three points is formed of the three points which are selected on the basis of a combination of the bit values (k_(i−1), l_(i−1)) of k and l of the binary representation data from the four points indicated in the expressions below by using the point P and the point Q:

m_(i)P+n_(i)Q

m_(i)P+(n_(i)+1)Q

(m_(i)+1)P+n_(i)Q

(m_(i)+1)P+(n_(i)+1)Q, and

[0067] the computation processor is operable to compute the set G′_(i) of the next three points on the basis of the set G′_(i+1) of the three computed points repeatedly to eventually compute a set G′₁ of three points, and in which W=kP+lQ is computed from the set G′₁ of three points.

[0068] In a ninth aspect, the present invention provides a recording medium recorded with a program for executing, on a computer system, an elliptic curve encryption process using a Montgomery elliptic curve By²=x³+Ax²+x on a prime field in which is computed an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on the Montgomery elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on the Montgomery elliptic curve, the program including an initial point computation step of calculating a set G_(t+1) of four initial points on the basis of the point P and the point Q; a bit value detection step of detecting a combination of each bit value of k and l of binary representation data of the scalar quantities k and l; and an iterative computation process step of selecting a computation relation of a set G_(t) of the next four points based on the set G_(t+1) of four initial points according to a combination of each bit value of the binary representation data of k and l detected in the bit value detection step and performing a computation process of the next four points in accordance with the computation relation of the set G_(t), and selecting a computation relation of a set G_(i) of the next four points based on a set G_(i+)1 of the four computed points and repeatedly performing a computation process of the next four points according to the number of bits of k or l of the binary representation data in accordance with the computation relation of the set G_(i).

[0069] In a tenth aspect, the present invention provides a recording medium recorded with a program for executing, on a computer system, an elliptic curve encryption process using a Montgomery elliptic curve By²=x³+Ax²+x on a prime field in which is computed an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on the Montgomery elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on the Montgomery elliptic curve, the program including a bit value detection step of detecting a combination of each bit value of k and l of binary representation data of the scalar quantities k and l; an initial point computation step of computing a set G′_(t+1) of three initial points on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of the binary representation data of the scalar quantities k and l; and an iterative computation process step of selecting a computation relation of a set G′_(t) of the next three points based on the set G′_(t+1) of three initial points according to a combination of each bit value of the binary representation data of k and l detected in the bit value detection step and performing a computation process of the next three points in accordance with the computation relation of the set G′_(t), and selecting a computation relation of a set G′_(i) of the next three points based on a set G′_(i+1) of the three computed points and repeatedly performing a computation process of the next three points according to the number of bits of k or l of the binary representation data in accordance with the computation relation of the set G′_(i).

[0070] In an eleventh aspect, the present invention provides a recording medium recorded with a program for executing, on a computer system, an elliptic curve encryption process using an elliptic curve y²+xy=x³+ax²+b on two extension fields in which is computed an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on the elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on the elliptic curve, the program including an initial point computation step of calculating a set G_(t+1) of four initial points on the basis of the point P and the point Q; a bit value detection step of detecting a combination of each bit value of k and l of binary representation data of the scalar quantities k and l; and an iterative computation process step of selecting a computation relation of a set G_(t) of the next four points based on the set G_(t+1) of four initial points according to a combination of each bit value of the binary representation data of k and l detected in the bit value detection step and performing a computation process of the next four points in accordance with the computation relation of the set G_(t), and selecting a computation relation of a set G_(i) of the next four points based on a set G_(i+1) of the four computed points and repeatedly performing a computation process of the next four points according to the number of bits of k or l of the binary representation data in accordance with the computation relation of the set G_(i).

[0071] In a twelfth aspect, the present invention provides a recording medium recorded with a program for executing, on a computer system, an elliptic curve encryption process using an elliptic curve y²+Xy=X³+ax²+b on two extension fields in which is computed an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on the elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on the elliptic curve, the program including a bit value detection step of detecting a combination of each bit value of k and l of binary representation data of the scalar quantities k and l; an initial point computation step of computing a set G′_(t+1) of three initial points on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of the binary representation data of the scalar quantities k and l by using the point P and the point Q; and an iterative computation process step of selecting a computation relation of a set G′_(t) of the next three points based on the set G′_(t+1) of three initial points according to a combination of each bit value of the binary representation data of k and l detected in the bit value detection step and performing a computation process of the next three points in accordance with the computation relation of the set G′_(t), and selecting a computation relation of a set G′_(i) of the next three points based on a set G′_(i+1) of the three computed points and repeatedly performing a computation process of the next three points according to the number of bits of k or l of the binary representation data in accordance with the computation relation of the set G′_(i).

[0072] The recording medium of the present invention is, for example, a storage medium or a communication medium which is provided in a computer-readable form to a general-purpose computer system which can execute various programs.

[0073] As a result of providing such a program in a computer-readable form, a process corresponding to the program is performed on the computer system. As a result of installing a computer program in the computer system, cooperative operation is exhibited on the computer system, and an operation/working-effect which is the same as that of the other aspects of the present invention can be obtained.

[0074] As has thus been described, according to the elliptic curve encryption processing apparatus, the elliptic curve encryption processing method, and the recording medium recorded with the program of the present invention, high-speed scalar multiplication becomes possible on a Montgomery elliptic curve on a prime field or on elliptic curves on two extension fields.

[0075] Furthermore, according to the elliptic curve encryption processing apparatus, the elliptic curve encryption processing method, and the recording medium recorded with the program of the present invention, for example, two scalar multiplications kP and lQ are not performed separately, but the computation process of kP+lQ is performed simultaneously on an elliptic curve on a prime body or on elliptic curves on two extension fields, thereby realizing higher speed. That is, by using a process in which, for initial points, four points or three points are set, and a set G_(i) of four points is computed from a set G_(i+1) of the four computed points in sequence, or a set G′_(i) of three points is computed from a set G′_(i+1) of the three computed points in sequence according to the binary data (k_(i), l_(i), k_(i−1) l_(i−1)) of k or l, high-speed scalar multiplication processing is possible. Furthermore, since there is no need to recover the y or Y coordinate, further improved high-speed processing is possible.

[0076] In addition, according to a method of sequentially computing a set G′_(i) of three points in the elliptic curve encryption processing apparatus, the elliptic curve encryption processing method, and the recording medium recorded with the program of the present invention, the speed can be increased by ¾ times, namely, by 25%, compared to the scalar multiplication kP+lQ of the conventional elliptic curve encryption processing. Furthermore, it is not necessary to recover the y or Y coordinate.

BRIEF DESCRIPTION OF THE DRAWINGS

[0077]FIG. 1 shows a scalar multiplication process flowchart (1) in which four points on an elliptic curve are used;

[0078]FIG. 2 shows a scalar multiplication process flowchart (2) in which four points on an elliptic curve are used;

[0079]FIG. 3 shows a scalar multiplication process flowchart (1) in which three points on an elliptic curve are used;

[0080]FIG. 4 shows a scalar multiplication process flowchart (2) in which three points on an elliptic curve are used;

[0081]FIG. 5 shows a scalar multiplication process flowchart (3) in which three points on an elliptic curve are used;

[0082]FIG. 6 shows a process flowchart in the case of (k_(i), l_(i))=(0, 0) in a scalar multiplication process using three points on an elliptic curve;

[0083]FIG. 7 shows a process flowchart in the case of (k_(i), l_(i))=(0, 1) in a scalar multiplication process using three points on an elliptic curve;

[0084]FIG. 8 shows a process flowchart in the case of (k_(i), l_(i))=(1, 0) in a scalar multiplication process using three points on an elliptic curve;

[0085]FIG. 9 shows a process flowchart in the case of (k_(i), l_(i))=(1, 1) in a scalar multiplication process using three points on an elliptic curve;

[0086]FIG. 10 shows an example of the system configuration which performs a simultaneous elliptic curve scalar multiplication process; and

[0087]FIG. 11 shows an example of the construction of encryption processing means which performs a simultaneous elliptic curve scalar multiplication process.

DETAILED DESCRIPTION

[0088] A description is given below of an elliptic curve encryption processing method and an elliptic curve encryption processing apparatus of the present invention, that is, a construction in which the addition point kP+lQ of scalar multiplication points of two different points on a Montgomery elliptic curve on a prime field and on elliptic curves on two extension fields are calculated simultaneously. In the following description, the method of simultaneously calculating the addition point kP+lQ of scalar multiplication points of two different points on a Montgomery elliptic curve on a prime field and on elliptic curves on two extension fields is called a “simultaneous scalar multiplication process”.

[0089] The scalar multiplication employing the Montgomery method described above in the Background of the Invention may be summarized as a calculation method such as that described below. More specifically, in conventional scalar multiplication kP (k=(k_(t) . . . k₀)₂, k_(t)=1) according to the Montgomery method, computations proceed while two points m_(i)P and (m_(i)+1)P are always calculated with respect to m_(i)=(k_(t) . . . k_(i))₂.

[0090] [First Embodiment]

[0091] A first embodiment of the present invention will now be described. In the construction of this embodiment, when the binary representation of the scalar quantities k and l contained in the addition point kP+lQ of scalar multiplication points of two different points on an elliptic curve are (k_(t) . . . k₀)₂ and (l_(t) . . . l₀)₂, and when m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, where k_(t)=1 or l_(t)=1, a set G_(i) of four points on an elliptic curve is defined as follows: $\begin{matrix} \begin{matrix} {G_{i} = \quad \left\{ {{{m_{i}P} + {n_{i}Q}},} \right.} \\ {\quad {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}},}} \\ {\quad {{{\left( {m_{i} + 1} \right)P} + {n_{i}Q}},}} \\ \left. \quad {{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} \right\} \end{matrix} & {{Equation}\quad (1)} \end{matrix}$

[0092] At this time, in the case of (k_(i), l_(i))=(0, 0), since m_(i)=2 m_(i+1) and n_(i)=2n_(i+1), the correspondence between a set G_(i+1) of four points and the set G_(i) of four points can be determined on the basis of the following equation (2): $\begin{matrix} \begin{matrix} {{{m_{i}P} + {n_{i}Q}} = \quad {2\left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)}} \\ {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ \left. \quad {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right) \end{matrix} & {{Equation}\quad (2)} \end{matrix}$

[0093] Furthermore, in the case of (k_(i), l_(i))=(0, 1), since m_(i)=2m_(i+1) and n_(i=)2n_(i+1)+1, the correspondence between a set G_(i+1) of four points and the set G_(i) of four points can be determined on the basis of the following equation (3): $\begin{matrix} \begin{matrix} {{{m_{i}P} + {n_{i}Q}} = \quad {\left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}} = \quad {2\left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)}} \\ {{{\left( {{m_{i}P} + 1} \right)P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)} \end{matrix} & {{Equation}\quad (3)} \end{matrix}$

[0094] Furthermore, in the case of (k_(i), l_(i))=(1, 0), since m_(i)=2 m_(i+1)+1 and n_(i)=2n_(i+1), the correspondence between a set G_(i+1) of four points and the set G_(i) of four points can be determined on the basis of the following equation (4): $\begin{matrix} \begin{matrix} {{{m_{i}P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {n_{i}Q}} = \quad {2\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right)}} \\ {{{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right)} \end{matrix} & {{Equation}\quad (4)} \end{matrix}$

[0095] Furthermore, in the case of (k_(i), l_(i))=(1, 1), since m_(i)=2 m_(i+1)+1 and n_(i)=2n_(i+1)+1, the correspondence between a set G_(i+1) of four points and the set G_(i) of four points can be determined on the basis of equation (5) below: $\begin{matrix} \begin{matrix} {\left. {{{m_{i}P} + {n_{i}Q}} = \quad \left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)} \right)\quad +} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} = \quad {2\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)}} \end{matrix} & {{Equation}\quad (5)} \end{matrix}$

[0096] Based on each of the above equations (2), (3), (4), and (5), G_(i) can be determined from G_(i+1).

[0097] Here, assuming that

T ₀ [i]=m _(i) P+n _(i) Q

T ₁ [i]=m _(i) P +(n _(i)+1)Q

T ₂ [i]=(m _(i)+1)P+n _(i) Q

T ₃ [i]=(m _(i)+1)P+(n _(i)+1)Q,

[0098] the equation is expressed as G_(i)={T₀[i], T₁[i], T₂[i], T₃[i]}

[0099] Since m_(t+1)=0 and n_(t+1)=0, by setting the initial value G_(t+1) of G_(i) as

T ₀ [t+1]=O (point at infinity)

T ₁ [t+1]=Q

T ₂ [t+1]=P

T₃ [t+1]=P+Q,

[0100] a process in accordance with the flowchart in FIG. 1 is performed to determine kP+1Q (=W).

[0101] Referring to the flowchart in FIG. 1, a process in which an elliptic curve encryption processing method of the present invention is used will be described below.

[0102] Initially, in step S101, P, Q, k, l, and r are input. Next, in steps S102 and S103, a check is made to determine whether or not kP is a point at infinity (O).

[0103] More specifically, when it is determined in step S102 that the point P is a point at infinity (O), since kP becomes a point at infinity (O), W=lQ, and the process proceeds to step S108, where a calculation of lQ is performed. Similarly, when it is determined in step S103 that k is 0, since kP becomes a point at infinity (O), W=lQ, and the process proceeds to step S108, where a calculation of lQ is performed. In step S108, Q is substituted into P, and l is substituted for k so that lQ is converted into the calculation of kP, and the process proceeds to step S111.

[0104] Next, in steps S104 and S105, a check is made to determine whether lQ is a point at infinity (O).

[0105] More specifically, when it is determined in step S104 that a point Q is a point at infinity (O), since lQ becomes a point at infinity (O), W=kP, and the process proceeds to step S111, where a calculation of kP is performed. Similarly, when it is determined in step S105 that l is 0, since lQ becomes a point at infinity (O), W=kP, and the process proceeds to step S111, where a calculation of kP is performed.

[0106] In step S106, it is determined whether P=Q. When P=Q, since W=kP+lQ=(k+l)P, in step S109, k=k+l mod r is set to convert (k+l)P into a calculation of kP, and then the process proceeds to step S111. In step S107, it is determined whether P=−Q. When P=−Q, since W=kP+lQ=(k−l)P, in step S110, k=k−l mod r is set to convert (k−l)P into a calculation of kP, and then the process proceeds to step S111.

[0107] When the determination is “Yes” in steps S102 to S107, since the calculation of kP+lQ has been converted into the calculation of kP in steps S108 to S110, in step S111, a scalar multiplication calculation is performed by using P and k as inputs in order to obtain an output W, and then the processing is terminated.

[0108] In step S112, an addition point P+Q of P and Q is determined. In step S113, k is subjected to dyadic expansion, and in step S114, l is subjected to dyadic expansion. At this time, k_(t)=1 or l_(t)=1. In step S115, the initial value G_(t+1) of G_(i) is set as follows:

T ₀ [t+1]=O (point at infinity)

T ₁ [t+1]=Q

T ₂ [t+1]=P

T₃ [t+1]=P+Q, and

[0109] in step S116, i is initialized to t (i=t).

[0110] In steps S117 to S125, G_(i) is calculated from G_(i+1) according to each bit (k_(i), l_(i)) of the dyadically-expanded k and l to eventually determine G₀.

[0111] More specifically, when it is determined in step S117 that (k_(i),l_(i))=(0, 0), the following are set in step S120 on the basis of equation (2) described above:

T ₀ [i]=2T ₀ [i+1]

T ₁ [i]=T ₁ [i+1]+T ₀ [i+1]

T ₂ [i]=T ₂ [i+1]+T ₀ [i+1]

T ₃ [i]=T ₃ [i+1]+T ₀ [i+1]

[0112] and G_(i) is calculated from G_(i+1).

[0113] When it is determined in step S118 that (k_(i), l_(i))=(0, 1), the following are set in step S121 on the basis of equation (3) described above:

T ₀ [i]=T ₁ [i+1]+T ₀ 8 t+1]

T ₁ [i]=2T ₁ [i+1]

T₂ [i]=T ₃ [i+1]+T ₀ [i+1]

T ₃ [i]=T ₃ [i+1]+T ₁ [i+1]

[0114] and G_(i) is calculated from G_(i+1).

[0115] When it is determined in step S119 that (k_(i), l_(i))=(1, 0), the following are set in step S122 on the basis of equation (4) described above:

T ₀ [i]=T ₂ [i+1]+T ₀ [i+1]

T ₁ [i]=T ₃ [i+1]+T ₀ [i+1]

T ₂ [i]=2T ₂ [i+1]

T ₃ [i]=T ₃ [i+1]+T ₂ [i+1]

[0116] and G_(i) is calculated from G_(i+1).

[0117] When the determination is “No” in steps S117 to S119, that is, when it is determined that (k_(i), l_(i))=(1, 1), the following are set in step S123 on the basis of equation (5) described above:

T ₀ [i]=T ₃ [i+1]+T ₀ [i+1]

T₁ [i]=T ₃ [i+1]+T ₁ [i+1]

T ₂ [i]=T ₃ [i+1]+T ₂ [i+1]

T ₃ [i]=2T ₃ [i+1]

[0118] and G_(i) is calculated from G_(i+1).

[0119] In step S124, i−1 is substituted into i, and in step S125, a check is made to determine whether or not i≧0. When i≧0, the process returns to step S117, where the same processes are repeatedly performed.

[0120] When the determination of i≧0 is “No” in step S125, it follows that G₀ is computed, and the process proceeds to step S126.

[0121] In the addition of points using the Montgomery method, it is required that the difference point be known, and the difference point can be found on the basis of the following:

T ₁ [i+1]−T ₀ [i+1]=Q

T ₂ [i+1]−T ₀ [i+1]=P

T ₃ [i+1]−T ₀ [i+1]=P+Q

T ₃ [i+1]−T ₁ [i+1]=P

T ₃ [i+1]−T ₂ [i+1]=Q

[0122] Here, since m₀=k and n₀=1, T₀[0]=kP+lQ. In step S126, T₀[0] is substituted into W, so that the addition point kP+lQ of scalar multiplication of two points=W=T₀[0], and the processing is terminated.

[0123] T₃[i+1]+T₀[i+1]may also be T₂[i+1]+T₁[i+1]. In this case, since T₂[i+1]−T₁[i+1]=P−Q, it is necessary to calculate the difference P−Q between P and Q in advance.

[0124] As described above, in the construction of the present invention, the scalar multiplication kP+lQ is performed by defining a set G_(i) of four points on an elliptic curve, and thus the results can be output at high speed.

[0125] [Second Embodiment]

[0126] Next, a processing construction in which the first embodiment is made even faster is described as a second embodiment. Similarly to the first embodiment, when the binary representation of the scalar quantities k and l contained in the addition point: kP+lQ of scalar multiplication of two different points on an elliptic curve are (k_(t) . . . k₀)₂ and (l_(t) . . . l₀)₂, and when m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, where k_(t)=1 or l_(t)=1, a set G_(i) of four points on an elliptic curve is defined as follows in a manner similar to the first embodiment:

G _(i) ={m _(i) P+n _(i)Q, m_(i) P+(n _(i)+1)Q, (m _(i)+1)P+n _(i) Q, (m _(i)+1)P+(n _(i)+1)Q}

[0127] At this time, in the case of (k_(i), l_(i)) (0, 0), since m_(i)=2 m_(i+1) and n_(i)=2n_(i+1), the correspondence between a set G_(i+1) of four points and the set G_(i) of four points can be determined on the basis of equation (2) described above, that is, the following equation: $\begin{matrix} \begin{matrix} {{{m_{i}P} + {n_{i}Q}} = \quad {2\left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)}} \\ {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \end{matrix} & {{Equation}\quad (2)} \end{matrix}$

[0128] This equation (2) can be transformed as shown below: $\begin{matrix} \begin{matrix} {{{m_{i}P} + {n_{i}Q}} = \quad {2\left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)}} \\ {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {\left( {n_{i} + 1} \right)Q}} \right)} \end{matrix} & {{Equation}\quad (6)} \end{matrix}$

[0129] In this equation (6), the element (m_(i+1)+1)P+(n_(i+1)+1)Q of G_(i+1) is an element which is not required to determine G_(i).

[0130] Furthermore, in the case of (k_(i), l_(i))=(0, 1), the correspondence between a set G_(i+1) of four points and the set G_(i) of four points is shown based on equation (3) described above. In equation (3), the element (m_(i+1)+1)P+n_(i+1)Q is an element which is not required to determine G_(i).

[0131] Furthermore, in the case of (k_(i), l_(i))=(1, 0), the correspondence between a set G_(i+1) of four points and the set G_(i) of four points is shown based on equation (4) described above. In equation (4), the element m_(i+1)P+(n_(i+1)+1)Q is an element which is not required to determine G_(i).

[0132] In the case of (k_(i),l_(i))=(1, 1), the correspondence between a set G_(i+1) of four points and the set G_(i) of four points is shown based on equation (5) described above. Equation (5) can be transformed as shown below: $\begin{matrix} \begin{matrix} {{{m_{i}P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)} \\ {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} = \quad {2\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)}} \end{matrix} & {{Equation}\quad (7)} \end{matrix}$

[0133] As is clear from equation (7) described above, the element m_(i+1)P+n_(i+1)Q of G_(i+1) is an element which is not required to determine G_(i).

[0134] In the manner described above, in the correspondence relation between the set G_(i+1) of four points and the set G_(i) of four points in each case of (k_(i), l_(i)), described in the first embodiment, the element (m_(i+1)+1−ki)P+(n_(i+1)+1−l_(i))Q of G_(i+1) can be defined as an element which is not required to determine G_(i).

[0135] Therefore, the set G_(i) of four points used in the first embodiment is defined as a set G′_(i) of three points as shown in equation (8) below:

G′ _(i) =G _(i)−{(m _(i)+1−k _(i−1))P+(n _(i)+1−l _(i−1))Q}  Equation (8)

[0136] At this time, since G_(i) can be calculated from G′_(i+1), it is possible to calculate G′_(i) from G′_(i+1). Here, when G′_(i) is calculated from G′_(i+1), the calculation method therefor depends on (k_(i), l_(i)). In addition, when G′_(i) is defined from G_(i), since the calculation method depends on (k_(i−1), l_(i−1)), when G′_(i) is calculated from G′_(i+1), the calculation method therefor depends on (k_(i), l_(i), k_(i−1), l_(i−1)).

[0137] A technique for calculating G′_(i) from G′_(i+1), corresponding to (k_(i), l_(i), k_(i−1), l_(i−1)), will be described below.

[0138] First, in the case of (k_(i), l_(i), k_(i−1), l_(i−1))=(0, 0, 0, 0), the following are satisfied:

G′ _(i+1) ={m _(i+1) P+n _(i+1) Q, m _(i+1) P+(n _(i+1)+1)Q, (m _(i+1)+1)P+n _(i+1) Q}

G′ _(i) ={m _(i) P+n _(i) Q, m _(i) P+(n _(i)+1)Q, (m _(i)+1)P+n _(i) Q}

[0139] Therefore, based on equation (6) described above, G′_(i) is calculated from G′_(i+1) on the basis of the following equation (9): $\begin{matrix} \begin{matrix} {{{m_{i}P} + {n_{i}Q}} = \quad {2\left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)}} \\ {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \end{matrix} & {{Equation}\quad (9)} \end{matrix}$

[0140] Next, in the case of (k_(i), l_(i), k_(i−1), l_(i−1))=(0, 0, 0, 1), the following are satisfied:

G′_(i+1) ={m _(i+1) P+n _(i+1) Q, m _(i+1) P+(n _(i+1)+1)Q, (m _(i+1)+1)P+n _(i+1) Q}

G′ _(i) ={m _(i) P+n _(i) Q, m _(i) P+(n _(i)+1)Q, (m _(i+1)+1)P+(n _(i)+1)Q}

[0141] Therefore, based on equation (6) described above, G′_(i) is calculated from G _(i+1) on the basis of the following equation (10): $\begin{matrix} \begin{matrix} {{{m_{i}P} + {n_{i}Q}} = \quad {2\left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)}} \\ {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)} \end{matrix} & {{Equation}\quad (10)} \end{matrix}$

[0142] Next, in the case of (k_(i), l_(i), k_(i−1), l_(i−1))=(0, 0, 1, 0), the following are satisfied:

G′ _(i+1) ={m _(i+1) P+n _(i+1) Q, m _(i+1) P+(n _(i+1)+1)Q, (m _(i+1)+1)P+n _(i+1) Q}

G′ _(i) ={m _(i) P+n _(i) Q, (m _(i)+1) P+n _(i) Q, (m _(i)+1)P+(n _(i)+1)Q}

[0143] Therefore, based on equation (6) described above, G′_(i) is calculated from G′_(i+1) on the basis of the following equation (11): $\begin{matrix} \begin{matrix} {{{m_{i}P} + {n_{i}Q}} = \quad {2\left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)}} \\ {{{\left( {m_{i} + 1} \right)P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {\left( {n_{i} + 1} \right)Q}} \right)} \end{matrix} & {{Equation}\quad (11)} \end{matrix}$

[0144] Next, in the case of (k_(i), l_(i), k_(i−1), l_(i−1))=(0, 0, 1, 1), the following are satisfied:

G′ _(i+1) ={m _(i+1) P+n _(i+1) Q, m _(i+1) P+(n _(i+1)+1)Q, (m _(i+1)+1)P+n _(i+1) Q}

G′ _(i) ={m _(i) P+(n _(i)+1)Q, (m _(i+1))P+n _(i) Q, (m _(i)+1)P+(n _(i+)1)Q}

[0145] Therefore, based on equation (6) described above, G′_(i) is calculated from G′_(i+1) on the basis of the following equation (12): $\begin{matrix} \begin{matrix} {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {\left( {n_{i} + 1} \right)Q}} \right)} \end{matrix} & {{Equation}\quad (12)} \end{matrix}$

[0146] Next, in the case of (k_(i), l_(i), k_(i−1), l_(i−1))=(0, 1, 0, 0), the following are satisfied:

G′ _(i+1) ={m _(i+1) P+n _(i+1) Q, m _(i+1) P+(n _(i+1)+1)Q, (m _(i+1)+1)P+(n _(i+1)+1)Q}

G′ _(i) ={m _(i) P+niQ, m _(i) P+(n _(i)+1)Q, (m _(i+1)+1)P+n _(i) Q}

[0147] Therefore, based on equation (3) described above, G′_(i) is calculated from G′_(i+1) on the basis of the following equation (13): $\begin{matrix} \begin{matrix} {{{m_{i}P} + {n_{i}Q}} = \quad {\left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}} = \quad {2\left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)}} \\ {{{\left( {m_{i} + 1} \right)P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \end{matrix} & {{Equation}\quad (13)} \end{matrix}$

[0148] Next, in the case of (k_(i), l_(i), k_(i−1), l_(i−1))=(0, 1, 0, 1), the following are satisfied:

G′ _(i+1) ={m _(i+1) P+n _(i+1) Q, m _(i+1) P+(n _(i+1)+1)Q, (m _(i+1)+1)P+(n _(i+1)+1)Q}

G′ _(i) ={m _(i) P+n _(i) Q, m _(i) P+(n _(i+1))Q, (m _(i)+1)P+(n _(i)+1)Q}

[0149] Therefore, based on equation (3) described above, G′_(i) is calculated from G+_(i+1) on the basis of the following equation (14): $\begin{matrix} \begin{matrix} {{{m_{i}P} + {n_{i}Q}} = \quad {\left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}} = \quad {2\left( {{m_{i + 1}P} + {\left( {n_{i} + 1} \right)Q}} \right)}} \\ {{{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)} \end{matrix} & {{Equation}\quad (14)} \end{matrix}$

[0150] Next, in the case of (k_(i), l_(i), k_(i−1), l_(i−1))=(0, 1, 1, 0), the following are satisfied:

G′ _(i+1) ={{m _(i+1) P+n _(i+1) Q, m _(i+1) P+(n _(i+1)+1)Q, (m _(i+1)+1)P+(n _(i+1)+1)Q}

G′ _(i) ={m _(i) P+n _(i) Q, (m _(i)+1)P+n _(i) Q, (m _(i)+1)P+(n _(i)+1)Q}

[0151] Therefore, based on equation (3) described above, G′_(i) is calculated from G′_(i+1) on the basis of the following equation (15): $\begin{matrix} \begin{matrix} {{{m_{i}P} + {n_{i}Q}} = \quad {\left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)} \end{matrix} & {{Equation}\quad (15)} \end{matrix}$

[0152] Next, in the case of (k_(i), l_(i), k_(i−1), l_(i−1))=(0, 1, 1, 1), the following are satisfied:

G′ _(i+1) ={m _(i+1) P+n _(i+1) Q, m _(i+1) P+(n _(i+1)+1)Q, (m _(i+1)+1)P+(n _(i+1)+1)Q}

G′ _(i) ={m _(i) P+(n _(i+)1)Q, (m _(i)+1)P+n _(i) Q, (m _(i)+1)P+(n _(i)+1)Q}

[0153] Therefore, based on equation (3) described above, G′_(i) is calculated from G′_(i+1) on the basis of the following equation (16): $\begin{matrix} \begin{matrix} {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}} = \quad {2\left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)}} \\ {{{\left( {m_{i} + 1} \right)P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)} \end{matrix} & {{Equation}\quad (16)} \end{matrix}$

[0154] Next, in the case of (k_(i), l_(i), k_(i−1), l_(i−1))=(1, 0, 0, 0), the following are satisfied:

G′ _(i+1) ={m _(i) P+n _(i) Q, m _(i+1)+1)P+n _(i+1) Q, (m _(i+1)+1)P+n _(i+1) Q, (m _(i+1)+1)P+(n _(i+1)+1)Q}

G′ _(i) ={m _(i) P+n _(i) Q, m _(i) P+(n _(i)+1)Q, (m _(i+)1)P+n _(i) Q}

[0155] Therefore, based on equation (4) described above, G′_(i) is calculated from G′_(i+1) on the basis of the following equation $\begin{matrix} \begin{matrix} {{{m_{i}P} + {n_{i}Q}} = \quad {\left( {{\left( m_{i + 1} \right)P} + {n_{i + 1}Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {n_{i}Q}} = \quad {2\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right)}} \end{matrix} & {{Equation}\quad (17)} \end{matrix}$

[0156] Next, in the case of (k_(i), l_(i), k_(i−1), l_(i−1))=(1, 0, 0, 1), the following are satisfied:

G′_(i+1) ={m _(i+1) P+n _(i+1) Q, (m _(i+1)+1)P+n _(i+1) Q, (m _(i+1)+1)P+(n _(i+1)+1)Q}

G′_(i) ={m _(i) P+n _(i) Q, m _(i) P+(n _(i)+1)Q, (m _(i)+1)P+(n _(i)+1)Q}

[0157] Therefore, based on equation (4) described above, G′_(i) is calculated from G′_(i+1) on the basis of the following equation (18): $\begin{matrix} \begin{matrix} {{{m_{i}P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right)} \end{matrix} & {{Equation}\quad (18)} \end{matrix}$

[0158] Next, in the case of (k₁, l_(i), k_(i−1), l_(i−1))=(1, 0, 1, 0), the following are satisfied:

G′ _(i+1) ={m _(i+1) P+n _(i+1) Q, (m _(i+1)+1)P+n _(i+1) Q, (m _(i+1)+1)P+(n _(i+1)+1)Q}

G′ _(i) ={m _(i) P+n _(i) Q, (m _(i)+1)P+n _(i) Q, (m _(i)+1)P+(n _(i+1))Q}

[0159] Therefore, based on equation (4) described above, G′_(i) is calculated from G′_(i+1) on the basis of the following equation (19): $\begin{matrix} \begin{matrix} {{{m_{i}P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {n_{i}Q}} = \quad {2\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right)}} \\ {{{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right)} \end{matrix} & {{Equation}\quad (19)} \end{matrix}$

[0160] Next, in the case of (k_(i), l_(i), k_(i−1), l_(i−1))=(1, 0, 1, 1), the following are satisfied:

G′ _(i+1) ={m _(i+1) P+n _(i+1) Q, (m _(i+1)+1)P+n _(i) Q, (m _(i)+1)P+(n _(i+1)+1)Q}

G′ _(i) ={m _(i) P+(n _(i+1)+1)Q, (m _(i)+1)P+n _(i) Q, (m _(i)+1)P+(n _(i+)1)Q}

[0161] Therefore, based on equation (4) described above, G′_(i) is calculated from G′_(i+1) on the basis of the following equation (20): $\begin{matrix} \begin{matrix} {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {n_{i}Q}} = \quad {2\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right)}} \\ {{{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right)} \end{matrix} & {{Equation}\quad (20)} \end{matrix}$

[0162] Next, in the case of (k_(i), l_(i), k_(i−1), l_(i−1))=(1, 1, 0, 0), the following are satisfied:

G′ _(i+1) ={m _(i+1) P+(n _(i+1)+1)Q, (m _(i+1)+1)P+ni+ ₁Q, (mi+₁+1)P+(ni+₁+1)Q}

G′ _(i) ={m _(i) P+n _(i) Q, m _(i)P+(n _(i)+1)Q, (m _(i)+1)P+n _(i) Q}

[0163] Therefore, based on equation (7) described above, G′_(i) is calculated from G′_(i+1) on the basis of the following equation (21): $\begin{matrix} \begin{matrix} {{{m_{i}P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)} \\ {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right)} \end{matrix} & {{Equation}\quad (21)} \end{matrix}$

[0164] Next, in the case of (k_(i), l_(i), k_(i−1), l_(i−1))=(1, 1, 0, 1), the following are satisfied:

G′ _(i+1) ={m _(i+1) P+(n _(i+1)+1)Q, (m _(i+1)+1)P+n _(i+1) Q, (m _(i+1)+1)P+(n _(i+1)+1)Q}

G′ _(i) ={m _(i) P+n _(i) Q, m _(i) P+(n _(i)+1)Q, (m _(i)+1)P+(n _(i)+1)Q}

[0165] Therefore, based on equation (7) described above, G′_(i) is calculated from G′_(i+1) on the basis of the following equation (22): $\begin{matrix} \begin{matrix} {{{m_{i}P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)} \\ {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} = \quad {2\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)}} \end{matrix} & {{Equation}\quad (22)} \end{matrix}$

[0166] Next, in the case of (k_(i), l_(i), k_(i−1), l_(i−1))=(1, 1, 1, 0), the following are satisfied:

G′ _(i+1) ={m _(i+1) P+(n _(i+1)+1)Q, (m _(i+1)+1)P+n _(i+1) Q, (m _(i+1)+1)P+(n _(i+1)+1)Q}

G′ _(i) ={m _(i) P+n _(i) Q, (m _(i+)1)P+n _(i) Q, (m _(i)+1)P+(n _(i)+1)Q}

[0167] Therefore, based on equation (7) described above, G′_(i) is calculated from G′_(i+1) on the basis of the following equation (23): $\begin{matrix} \begin{matrix} {{{m_{i}P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} = \quad {2\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)}} \end{matrix} & {{Equation}\quad (23)} \end{matrix}$

[0168] Lastly, in the case of (k_(i), l_(i), k_(i−1), l_(i−1))=(1, 1, 1, 1), the following are satisfied:

G′ _(i+1) ={m _(i+1) P+(n _(i+1)+1)Q, (m _(i+1)+1)P+n _(i+1) Q, (m _(i+1)+1)P+(n _(i+1)+1)Q}

G′ _(i) ={m _(i) P+(n _(i)+1)Q, (m _(i)+1)P+n _(i) Q, (m _(i)+1)P+(n _(i)+1)Q}

[0169] Therefore, based on equation (7) described above, G′_(i) is calculated from G′_(i+1) on the basis of the following equation (24): $\begin{matrix} \begin{matrix} {{{m_{i}P} + {\left( {n_{i} + 1} \right)Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{m_{i + 1}P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {n_{i}Q}} = \quad {\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right) +}} \\ {\quad \left( {{\left( {m_{i + 1} + 1} \right)P} + {n_{i + 1}Q}} \right)} \\ {{{\left( {m_{i} + 1} \right)P} + {\left( {n_{i} + 1} \right)Q}} = \quad {2\left( {{\left( {m_{i + 1} + 1} \right)P} + {\left( {n_{i + 1} + 1} \right)Q}} \right)}} \end{matrix} & {{Equation}\quad (24)} \end{matrix}$

[0170] Based on each of the above equations, G′_(i) can be calculated from G′_(i+1) with respect to all the cases that (k_(i), l_(i), k_(i−1), l_(i−1)) can take.

[0171] A process of determining W=kP+lQ by using the second embodiment will now be described with reference to the flowcharts shown in FIG. 3 and those that follow. The outline of these flowcharts is that G′_(i) is represented as G′_(i)={T₀[i], T₁[i], T₂[i]}, and based on m_(t+1)=0 and n_(t+1)=0, the initial value of G′_(i+1) is determined to calculate G′_(i) so that W=kP+lQ is determined.

[0172] Initially, in step S201, P, Q, k, l, and r are input. Next, in steps S202 and S203, a check is made to determine whether or not kP is a point at infinity (O).

[0173] More specifically, when it is determined in step S202 that a point P is a point at infinity (O), since kP becomes a point at infinity (O), W=lQ, and the process proceeds to step S208, where a calculation of lQ is performed. Similarly, when it is determined in step S203 that k is 0, since kP becomes a point at infinity (O), W=lQ, and the process proceeds to step S208, where a calculation of lQ is performed. In step S208, Q is substituted into P, and l is substituted into k so that lQ is converted into the calculation of kP, and then the process proceeds to step S211.

[0174] Next, in steps S204 and S205, a check is made to determine whether or not lQ is a point at infinity (O).

[0175] More specifically, when it is determined in step S204 that a point Q is a point at infinity (O), since lQ becomes a point at infinity O0), W=kP, and the process proceeds to step S211, where a calculation of kP is performed. Similarly, when it is determined in step S205 that 1 is 0, since lQ becomes a point at infinity (O), W=kP, and the process proceeds to step S211, where a calculation of kP is performed.

[0176] In step S206, it is determined whether or not P Q. When P=Q, since kP+lQ=(k+l)P, in step S209, k=k+l mod r is set to convert (k+l)P into a calculation of kP, and the process proceeds to step S211. In step S207, it is determined whether or not P=−Q. When P=−Q, since W=kP+lQ=(k−l)P, in step S210, k=k−l mod r is set to convert (k−l)P into a calculation of kP, and then the process proceeds to step S211.

[0177] When the determination is “Yes” in steps S202 to S207, the calculation of kP+lQ has been converted into the calculation of kP in steps S208 to S210. Therefore, in step S211, a scalar multiplication calculation is performed by using P and k as inputs in order to obtain an output W, and then the processing is terminated.

[0178] In step S212, an addition point P+Q and a difference point P−Q of P and Q are determined. In step S213, k is subjected to dyadic expansion, and in step S214, l is subjected to dyadic expansion. At this time, k_(t)=1 or l_(t)=1.

[0179] In steps S215 to S219, the initial value G′_(t+1) of G′_(i) is determined. Initially, when it is determined in step S215 that (k_(t), l_(t))=(0, 1), since G′_(t+1)={O (point at infinity), Q, P+Q} on the basis of equations (1) and (8), in step S217, the following substitutions are performed:

T ₀ [t+1]=O(point at infinity)

T ₁ [t+1]=Q

T ₂ [t+1]=P+Q

[0180] Next, when it is determined in step S216 that (k_(t), l_(t))=(1, 0), since G′_(t+1)={O (point at infinity), Q, P+Q} on the basis of equations (1) and (8), in step S217, the following substitutions are performed:

T ₀ [t+1]=O (point at infinity)

T ₁ [t+1]=P

T ₂[t+1]=P+Q

[0181] Lastly, when the determination in steps S216 and S217 is “No”, that is, when it is determined that (k_(t), l_(t))=(1, 1), since G′_(t+1)={Q, P, P+Q} on the basis of equations (1) and (8), in step S217, the following substitutions are performed:

T ₀ [t+1]=Q

T ₁ [t+1]=P

T ₂ [t+1]=p+Q

[0182] Thereafter, in step S220, i is initialized to t (i=t). In steps S221 to S229, G′_(i) is computed from G′_(i+1) according to the value of (k_(i), l_(i), k_(i−1) l_(i−1)) to eventually determine G′₁.

[0183] When it is determined in step S221 that (k_(i), l_(i))=(0, 0), the process of step S224 is performed. The detailed flowchart of the process of step S224 is shown in FIG. 6.

[0184] When it is determined in step S301 in FIG. 6 that (k_(i−1) l_(i−1))=(0, 0), in step S304, the following substitutions are performed on the basis of equation (9) described above:

T ₀ [i]=2T ₀ [i+1]

T ₁ [i]=T ₁ [i+1]+T ₀ [i+1]

T ₂ [i]=T ₂ [i+1]+T ₀ [i+1]

[0185] and G′_(i) is computed from G′_(i+1).

[0186] When it is determined in step S302 that (k_(i−1), l_(i−1))=(0, 1), in step S305, the following substitutions are performed on the basis of equation (10) described above:

T ₀ [i]=2T ₀ [i+1]

T ₁ [i]=T ₁ [i+1]+T ₀ [i+1]

T ₂ [i]=T ₂ [i+1]+T ₁ [i+1]

[0187] and G′_(i) is computed from G′_(i+1).

[0188] When it is determined in step S303 that (k_(i−1), l_(i−1))=(1, 0), in step S306, the following substitutions are performed on the basis of equation (11) described above:

T ₀ [i]=2T ₀ [i+1]

T ₁ [i]=T ₂ [i+1]+T ₀ [i+1]

T ₂ [i]=T ₂ [i+1]+T ₁ [i+1]

[0189] and G′_(i) is computed from G′_(i+1).

[0190] When the determination is “No” in steps S301 to S303, that is, when it is determined that (k_(i−1), l_(i−1))=(1, 1), in step S307, the following substitutions are performed on the basis of equation (12) described above:

T ₀ [i]=T ₁ [i+1]+T ₀ ₀i+1]

T ₁ [i]=T ₂ [i+1]+T ₀ [i+1]

T ₂ [i]=T ₂ [i+1]+T ₁ [i+1]

[0191] and G′_(i) is computed from G′_(i+1).

[0192] In steps S304 to S307, the difference points required for the addition of points become as follows:

T ₁ [i+1]−T ₀ [i+1]=Q

T ₂ [i+1]−T ₀ [i+1]=P

T ₂ [i+1]−T ₁ [i+1]=P−Q

[0193] In each case, the process proceeds to step S228.

[0194] When it is determined in step S222 that (k_(i), l_(i))=(0, 1), the process of step S225 is performed. The detailed flowchart of the process of step S225 is shown in FIG. 7.

[0195] When it is determined in step S401 that (k_(i−1), l_(i−1))=(0, 0), in step S404, the following substitutions are performed on the basis of equation (13) described above:

T ₀ [i]=T ₁ [i+1]+T ₀ [i+1]

T ₁ [i]=2T ₁ [i+1]

T ₂ [i]=T ₂ [i+1]+T ₀ [i+1]

[0196] and G′_(i) is computed from G′_(i+1).

[0197] When it is determined in step S402 that (k_(i−1), l_(i−1))=(0, 1), in step S405, the following substitutions are performed on the basis of equation (14) described above:

T ₀ [i]=T ₁ [i+1]+T ₀ [i+1]

T ₁ [i]=2T ₁ [i+1]

T ₂ [i]=T ₂ [i+1]+T ₁ [i+1]

[0198] and G′_(i) is computed from G′_(i+1).

[0199] When it is determined in step S403 that (k_(i−1), l_(i−1))=(1, 0), in step S406, the following substitutions are performed on the basis of equation (15) described above:

T ₀ [i]=T ₁ [i+1]+T ₀ [i+1]

T ₁ [i]=T ₂ [i+1]+T ₀ [i+1]

T ₂ [i]=T ₂ [i+1]+T ₁ [i+1]

[0200] and G′_(i) is computed from G′_(i+1).

[0201] When the determination is “No” in steps S401 to S403, that is, when it is determined that (k_(i−1), l_(i−1))=(1, 1), in step S407, the following substitutions are performed on the basis of equation (16) described above:

T ₀ [i]=2T ₁ [i+1]

T ₁ [i]=T ₂ [i+1]+T ₀ [i+1]

T ₂ [i]=T ₂ [i+1]+T ₁ [i+1]

[0202] and G′_(i) is computed from G′_(i+1).

[0203] In steps S404 to S407, the difference points required for the addition of points become as follows:

T ₁ [i+1]−T ₀ [i+1]=Q

T ₂ [i+1]−T ₀ [i+1]=P+A

T ₂ [i+1]−T ₁ [i+1]=P

[0204] In each case, the process proceeds to step S228.

[0205] When it is determined in step S223 that (k_(i), l_(i))=(1, 0), the process of step S226 is performed. The detailed flowchart of the process of step S226 is shown in FIG. 8.

[0206] When it is determined in step S501 in FIG. 8 that (k_(i−1), l_(i−1))=(0, 0), in step S504, the following substitutions are performed on the basis of equation (17) described above:

T ₀ [i]=T ₁ [i+1]+T ₀ [i+1]

T ₁ [i]=T ₂ [i+1]+T ₀ [i+1]

T ₂ [i]=2T ₁ [i+1]

[0207] and G′_(i) is computed from G′_(i+1).

[0208] When it is determined in step S502 that (k_(i−1), l_(i−1))=(0, 1), in step S505, the following substitutions are performed on the basis of equation (18) described above:

T ₀ [i]=T ₁ [i+1]+T ₀ [i+1]

T ₁ [i]=T ₂ [i+1]+T ₁ [i+1]

T ₂ [i]=T ₂ [i+1]+T₁ [i+1]

[0209] and G′_(i) is computed from G′_(i+1).

[0210] When it is determined in step S503 that (k_(i−1), l_(i−1))=(0, 1), in step S506, the following substitutions are performed on the basis of equation (19) described above:

T ₀ [i]=T ₁ [i+1]+T ₀ [i+1]

T ₁ [i]=2T ₁ [i+1]

T ₂ [i]=T ₂ [i+1]+T ₁ [i+1]

[0211] and G′_(i) is computed from G′_(i+1).

[0212] When the determination is “No” in steps S501 to S503, that is, when it is determined that (k_(i−1)l_(i−1))=(1, 1), in step S507, the following substitutions are performed on the basis of equation (20) described above:

T ₀ [i]=T ₁ [i+1]+T ₀ [i+1]

T ₁ [i]=2T ₁ [i+1]

T ₂ [i]=T ₂[i+1]+T ₁ [i+1]

[0213] and G′_(i) is computed from G′_(i+1).

[0214] In steps S504 to S507, the difference points required for the addition of points become as follows:

T ₁ [i +1]−T ₀ [i+1]=P

T ₂ [i+1]−T ₀ [i+1]=P+Q

T ₂ [i+1]−T ₁ [i+1]=Q

[0215] In each case, the process proceeds to step S228.

[0216] When the determination is “No” in steps S221 to S223, that is, when it is determined that (k_(i), l_(i))=(1, 1), the process of step S227 is performed. The detailed flowchart of the process of step S227 is shown in FIG. 9.

[0217] When it is determined in step S601 that (k_(i−1), l_(i−1))=(0, 0), in step S604, the following substitutions are performed on the basis of equation (21) described above:

T ₀ [i]=T ₁ [i+1]+T ₀ [i+1]

T ₁ [i]=T ₂ [i+1]+T ₀ [i+1]

T ₂ [i]=T ₂ [i+1]+T ₁ [i+1]

[0218] and G′_(i) is computed from G′_(i+1).

[0219] When it is determined in step S602 that (k_(i−1), l_(i−1))=(0, 1), in step S605, the following substitutions are performed on the basis of equation (22) described above:

T ₀ [i]=T ₁ [i+1]+T ₀ [i+1]

T ₁ [i]=T ₂ [i+1]+T ₀ [i+1]

T ₂ [i]=2T ₂ [i+1]

[0220] and G′_(i) is computed from G′_(i+1).

[0221] When it is determined in step S603 that (k_(i−1), l_(i−1))=(1, 0), in step S606, the following substitutions are performed on the basis of equation (23) described above:

T ₀ [i]=T ₁ [i+1]+T ₀ [i+1]

T ₁ [i]=T ₂ [i+1]+T ₁ [i+1]

T ₂ [i]=2T₂ [i+1]

[0222] and G′_(i) is computed from G′_(i+1).

[0223] When the determination is “No” in steps S601 to S603, that is, when it is determined that (k_(i−1), l_(i−1))=(1, 1), in step S607, the following substitutions are performed on the basis of equation (24) described above:

T ₀ [i]=T ₂ [i+1]+T ₀ [i+1]

T₁ [i]=T ₂ [i+1]+T ₁ [i+1]

T ₂ [i]=2T ₂ [i+1]

[0224] and G_(i) is calculated from G_(i+1).

[0225] In steps S604 to S607, the difference points required for the addition of points become as follows:

T ₁ [i+1]−T ₀ [i+1]=P−Q

T ₂ [i+1]−T ₀ [i+1]=P

T ₂ [i+1]−T ₁ [i+1]=Q

[0226] In each case, the process proceeds to step S228.

[0227] In step S228, i−1 is substituted into i, and in step S229, a check is made to determine whether or not i≧0. When i≧0, the process returns to step S221, where the same processes are repeatedly performed.

[0228] When the determination of i>0 is “No” in step S229, it follows that G′₁ is computed, and the process proceeds to step S230.

[0229] In steps S230 to S236, W is determined from G′₁. W is one of the three points which form the G′₀, and corresponds to k_(P)+lQ.

[0230] When it is determined in step S230 that (k₀, l₀)=(0, 0), the following is satisfied:

T ₀[1]=m₁ P+n ₁ Q, and

k=m ₀=2m ₁

l=n ₀=2n ₁.

[0231] Therefore, in step S233, 2T₀[1] is substituted into W (W=2T₀[1]), and then the processing is terminated.

[0232] When it is determined in step S231 that (k₀, l₀)=(0, 1), the following are satisfied:

T ₀[1]=m ₁ P+n ₁ Q

T ₁[1]=m ₁ P+(n ₁+1)Q, and

k=m ₀=2m ₁

l=n ₀=2n ₁+1.

[0233] Therefore, in step S234, T₁[1]+T₀[1] is substituted into W (W=T₁[1]+T₀[1]), and then the processing is terminated. At this time, the difference point required for the addition of points is T₁[1]−T₀[1]=Q.

[0234] When it is determined in step S232 that (k₀, l₀)=(1, 0), the following are satisfied:

T ₀[1]=m ₁ P+n ₁ Q

T ₁[1]=(m ₁+1)P+n ₁ Q, and

k=m ₀=2m ₁+1

l=n ₀=2n ₁.

[0235] Therefore, in step S235, T₁[1]+T₀[1] is substituted into W (W=T₁[1]+T₀[1]), and then the processing is terminated. At this time, the difference point required for the addition of points is T₁[1]−T₀[1]=P.

[0236] When the determination in steps S230 to S232 is “No”, that is, when it is determined that (k₀, l₀)=(1, 1), the following are satisfied:

T ₀[1]=m ₁ P+(n ₁+1)Q

T ₁[1]=(m ₁+1)P+n ₁ Q, and

k=m ₀=2m ₁+1

l=n ₀=2n ₁+1.

[0237] Therefore, in step S236, T₁[1]+T₀[1] is substituted into W (W=T₁[1]+T₀[1]), and then the processing is terminated. At this time, the difference point required for the addition of points is T₁[1]+T₀[1]=P−Q.

[0238] As has thus been described, in the construction of the present invention, a set G′_(i) of three points on an elliptic curve is defined and the scalar multiplication kP+lQ is performed, and thus the results can be output at high speed.

[0239] Both the first embodiment and the second embodiment can be carried out on a Montgomery elliptic curve on a prime field and on elliptic curves on two extension fields, and can be carried out in both an affine coordinate system and a projective coordinate system.

[0240] [Example of System Configuration]

[0241] The series of processes described in the embodiments above can be performed by a combination of hardware and software. That is, the construction may be formed in such a way that the processes are performed by causing a general-purpose computer or a microcomputer to execute a program. When the series of processes is to be performed by software, the program which forms the software is installed in, for example, a general-purpose computer, a one-chip microcomputer, etc. FIG. 10 shows an example of the configuration of an embodiment of a computer in which the program which executes the above-described series of processes is installed.

[0242] The example of the system configuration shown in FIG. 10 is one example, and the system is not necessarily required to have all the functions shown here. A CPU (Central Processing Unit) 101 shown in FIG. 10 is a processor which executes various application programs and the OS (Operating System). A ROM (Read Only Memory) 102 has stored therein programs to be executed by the CPU 101 and/or fixed data as computation parameters. A RAM (Random Access Memory) 103 is used as a storage area or a work area for programs executed in the processor of the CPU 101 and for parameters which change appropriately in the program process.

[0243] A hard disk drive (HDD) 104 performs control of hard disks and performs a process of storing and reading various types of data and programs into and from the hard disks. Encryption processing means 105 performs an encryption/decryption process on transmission data, etc. Here, although an example in which the encryption processing means is formed as an individual module is described, the construction may be formed in such a way that an independent encryption processing module is not provided, and, for example, an encryption processing program is stored in the ROM 102, and the CPU 101 reads and executes the program stored in the ROM. A memory (secure module) 106 is formed as a memory, for example, having a tamper-proof structure, so that it can be used as a storage area for key data required for encryption processing and for an access permit. These pieces of data can also be stored in another memory area and storage medium.

[0244] A bus 121 is formed of a PCI (Peripheral Component Interconnect) bus, etc., and allows data transfer with each input device via each module and an input/output interface 122.

[0245] An input section 111 is formed of, for example, a keyboard and a pointing device, and is operated to input various commands and data to the CPU 101 by a user. An output section 112 is, for example, a CRT or a liquid-crystal display, and displays various types of information in the form of text, images, etc.

[0246] A communication section 113 performs a communication process with an entity connected to the system, for example, a communication entity of encrypted data. The communication section 113 performs a process of transmitting data supplied from each storage section, data processed by the CPU 101, encrypted data, etc., or a process of receiving data from another entity, under the control of the CPU 101.

[0247] A drive 114 performs recording into and reproduction from a removable recording medium 115, such as a floppy disk, a CD-ROM (Compact Disk-Read Only Memory), an MO (Magneto-optical) disk, a DVD (Digital Versatile Disk), a magnetic disk, or a semiconductor memory. The drive 114 performs reproduction of a program and/or data from each removable recording medium 115, and performs storage of a program and/or data into the removable recording medium 115.

[0248] When a program and/or data recorded in each recording medium is to be read and the program is executed or the data is processed by the CPU 101, the read program and/or data are supplied to, for example, the connected RAM 103 via the interface 122 and the bus 121.

[0249] The program for executing an elliptic curve processing computation contained in the above description, referring to each flowchart, is, for example, stored in the ROM 102 and is executed by the CPU 101, or is stored in a hard disk and is supplied via a HDD 104 to the CPU 101, whereby the program is executed.

[0250]FIG. 11 shows the encryption processing means 105 shown in FIG. 10 as detailed processing blocks according to function. As shown in FIG. 11, the encryption processing means 105 comprises an encryption process computation section 201 for performing computations associated with various encryption processes, such as a data encryption process, a data decryption process, signature processing, and signature verification; an elliptic curve creation section 202 for performing a process of creating an elliptic curve; a public key/secret key generation section 203 for performing a process of generating a public key and a secret key used in a public key encryption method; a random number generation section 204 for generating a random number used for key generation and other various computations; and a storage section 205 for storing various parameters used in encryption process computations, etc.

[0251] For example, when encryption of plain text which is input from the outside, decryption of cyphertext, creation of a signature, a signature verification process, etc., are to be performed, the elliptic curve creation section 202 first creates an elliptic curve, and the encryption processing computation section 201 performs various encryption processes by using the key generated in the public key/secret key generation section 203.

[0252] For example, the elliptic curve creation section 202 performs a process of creating a Montgomery elliptic curve EM (GF(p)) represented by By²=x³+Ax²+X. The encryption processing computation section 201 performs the above-described scalar multiplication process on the basis of the elliptic curve created by the elliptic curve creation section 202. More specifically, the encryption processing computation section 201 performs a computation process which converts the Montgomery elliptic curve E^(M) (GF(p)) represented by By²=x³+Ax²+x into projective coordinates (X, Y, Z), defines a set G_(i) of four points such that G_(i) can be computed from G_(i+1) in the projective coordinates (X, Y, Z), defines, on the basis of G_(i), a set G′_(i) of three points such that G′_(i) can be computed from G′_(i+1), sets an initial value G′_(i+1) by setting m_(t+1)=0 and n_(t+1)=0, calculates G′_(i) according to (k_(i), l_(i), k_(i−1), l_(i−1)) in order to compute G′₁, and determines kP+lQ on the basis of G′₁.

[0253] The series of processes described in the specification can be performed by hardware, software, or a combination thereof. When the processes are to be performed by software, a program in which a process sequence is recorded may be installed into a memory inside a computer incorporated into dedicated hardware so that the processes are executed, or a program may be installed into a general-purpose computer capable of performing various processes so that the processes are executed.

[0254] For example, a program can be prerecorded in a hard disk and a ROM (Read Only Memory), as the recording medium. Alternatively, a program can be prestored (prerecorded) temporarily or permanently in a removable recording medium, such as a floppy disk, a CD-ROM, an MO disk, a DVD, a magnetic disk, or a semiconductor memory. Such a removable recording medium can be provided as so-called packaged software.

[0255] In addition to being installed into a computer from a removable recording medium such as that described above, programs may be transferred in a wireless manner from a download site to a computer or may be transferred by wire to a computer via a network, such as a LAN (Local Area Network) or the Internet, and in the computer, the programs which are transferred in such a manner may be received and installed into a recording medium, such as a hard disk, contained therein.

[0256] The various processes described in this specification may be performed not only in a time-series manner along the described sequence, but also may be performed in parallel or individually according to the processing performance of the device which performs processing or according to necessity. Furthermore, the system in this specification is a logical assembly of a plurality of devices, and the individual devices do not necessarily exist in the same housing.

[0257] Although the invention herein has been described with reference to particular embodiments, it is to be understood that these embodiments are merely illustrative of the principles and applications of the present invention. It is therefore to be understood that numerous modifications may be made to the illustrative embodiments and that other arrangements may be devised without departing from the spirit and scope of the present invention as defined by the appended claims. 

1. An elliptic curve encryption processing method using a Montgomery elliptic curve By²=x³+Ax+x on a prime field, said elliptic curve encryption processing method comprising: in the computation of an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on said Montgomery elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on said Montgomery elliptic curve, an initial point computation step of calculating a set G_(t+1) of four initial points on the basis of said point P and said point Q; a bit value detection step of detecting a combination of each bit value of k and l of binary representation data of said scalar quantities k and l; and an iterative computation process step of selecting a computation relation of a set G_(t) of the next four points based on said set G_(t+1) of four initial points according to a combination of each bit value of said binary representation data of k and l detected in said bit value detection step and performing a computation process of the next four points in accordance with said computation relation of said set G_(t), and selecting a computation relation of a set G_(i) of the next four points based on a set G_(i+1) of the four computed points and repeatedly performing a computation process of the next four points according to the number of bits of k or l of said binary representation data in accordance with said computation relation of said set G_(i).
 2. An elliptic curve encryption processing method according to claim 1, wherein, when the high-order bit values of the high orders t to i when each bit of said binary representation data of k and l are k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, said set G_(i) of four points is formed of the four points which are indicated in the expressions below by using said point P and said point Q: m_(i)P+n_(i)Q m_(i)P+(n_(i)+1)Q (m_(i)+1) P+n_(i)Q (m_(i)+1)P+(n_(i)+1)Q, and said initial points are set as the four points shown below which are computed on the basis of said expressions on the basis of m_(t+1)=k_(t+1)=0 and n_(t+1)=l_(t+1)=0 by setting i=t+1: T ₀ [t+1]=O (point at infinity) T ₁ [t+1]=Q T ₂ [t+1]=P T ₃ [t+1]=P+Q.
 3. An elliptic curve encryption processing method according to claim 1, wherein, when the high-order bit values of the high orders t to i when each bit of said binary representation data of k and l is k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, said set G_(i) of four points is formed of the four points which are indicated in the expressions below by using said point P and said point Q: m_(i)P+n_(i)Q m_(i)P+(n_(i)+1)Q (m_(i)+1)P+n_(i)Q (m_(i)+1)P+(n_(i)+1)Q, and said iterative computation process step includes computing said set G_(i) of the next four points repeatedly on the basis of said set G_(i+1) of the four computed points in order to eventually compute a set G₀ of four points, and in which one point which is a constituent of said set G₀ of four points is computed as W=kP+lQ.
 4. An elliptic curve encryption processing method using a Montgomery elliptic curve By²=x³+Ax²+x on a prime field, said elliptic curve encryption processing method comprising: in the computation of an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on said Montgomery elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on said Montgomery elliptic curve, a bit value detection step of detecting a combination of each bit value of k and l of binary representation data of said scalar quantities k and l; an initial point computation step of computing a set G′_(t+1) of three initial points on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of said binary representation data of said scalar quantities k and l; and an iterative computation process step of selecting a computation relation of a set G′_(t) of the next three points based on said set G′_(t+1) of three initial points according to a combination of each bit value of said binary representation data of k and l detected in said bit value detection step and performing a computation process of the next three points in accordance with said computation relation of said set G′_(t), and selecting a computation relation of a set G′_(i) of the next three points based on a set G′_(i+1) of the three computed points and repeatedly performing a computation process of the next three points according to the number of bits of k or l of said binary representation data in accordance with said computation relation of said set G′_(i).
 5. An elliptic curve encryption processing method according to claim 4, wherein, when the high-order bit values of the high orders t to i when each bit of said binary representation data of k and l are k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, said set G′_(i) of three points is formed of the three points which are selected on the basis of a combination of the bit value (k_(t−1), l_(t−1)) of k and l of said binary representation data from the following four points indicated in the expression below by using said point P and said point Q: m_(i)P+n_(i)Q m_(i)P+(n_(i)+1)Q (m_(i)+1)P+n_(i)Q (m_(i)+1)P+(n_(i)+1)Q, and said initial points are set as the three points which are selected on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of said binary representation data from the following four points: T ₀ [t+1]=O (point at infinity) T ₁ [t+1]=Q T ₂ [t+1]=P T ₃ [t+1]=P+A which are the four points computed based on the above relations from m_(t+1)=k_(t+1)=0 and n_(t+1)=l_(t+1)=0 by setting i=t+1.
 6. An elliptic curve encryption processing method according to claim 4, wherein, when the high-order bit values of the high orders t to i when each bit of said binary representation data of k and l are k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . ki)₂ and n_(i)=(l_(t) . . . l_(i))₂, said set G′_(i) of three points is formed of the three points which are selected on the basis of a combination of the high-order bit value (k_(t), l_(t)) of k and l of said binary representation data indicated in the expressions below by using said point P and said point Q: m_(i)P+n_(i)Q m_(i)P+(n_(i)+1)Q (m_(i) +1)P+n_(i)Q (m_(i)+1)P+(n_(i)+1)Q, and said iterative computation process step includes computing said set G′_(i) of the next three points from said set G′_(i+1) of the three computed points repeatedly to eventually compute a set G′₁ of three points, and W=kP+lQ is computed from said set G′₁ of three points.
 7. An elliptic curve encryption processing method using an elliptic curve y²+xy=x³+ax²+b on two extension fields, said elliptic curve encryption processing method comprising: in the computation of an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on said elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on said elliptic curve, an initial point computation step of calculating a set G_(t+1) of four initial points on the basis of said point P and said point Q; a bit value detection step of detecting a combination of each bit value of k and l of binary representation data of said scalar quantities k and l; and an iterative computation process step of selecting a computation relation of a set Gt of the next four points based on said set G_(t+1) of four initial points according to a combination of each bit value of said binary representation data of k and l detected in said bit value detection step and performing a computation process of the next four points in accordance with said computation relation of said set G_(t), and selecting a computation relation of a set G_(i) of the next four points based on a set G_(i+1) of the four computed points and repeatedly performing a computation process of the next four points according to the number of bits of k or l of said binary representation data in accordance with said computation relation of said set G_(i).
 8. An elliptic curve encryption processing method according to claim 7, wherein, when the high-order bit values of the high orders t to i when each bit of said binary representation data of k and l are k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, said set G_(i) of four points is formed of the four points which are indicated in the expressions below by using said point P and said point Q: m_(i)P+n_(i)Q m_(i)P+(n_(i)+1)Q (m_(i)+1)P+n_(i)Q (m_(i)+1) P+(n_(i)+1) Q, and said initial points are set as the four points shown below which are computed on the basis of said expressions on the basis of m_(t+1)=k_(t+1)=0 and n_(t+1)=l_(t+1)=0 by setting i=t+1: T₀ [t+1]=O (point at infinity) T ₁ [t+1]=Q T ₂ [t+1] P T ₃ [t+1] P+Q.
 9. An elliptic curve encryption processing method according to claim 7, wherein, when the high-order bit values of the high orders t to i when each bit of said binary representation data of k and l is k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, said set G_(i) of four points is formed of the four points which are indicated in the expressions below by using said point P and said point Q: m_(i)P+n_(i)Q m_(i)P+(n_(i)+1)Q (m_(i)+1)P+n_(i)Q (m_(i)+1)P+(n_(l)+1)Q, and said iterative computation process step includes computing said set G_(i) of the next four points repeatedly on the basis of said set G_(i+1) of the four computed points in order to eventually compute a set G₀ of four points, and in which one point which is a constituent of said set G₀ of four points is computed as W=kP+lQ.
 10. An elliptic curve encryption processing method using an elliptic curve y²+Xy=X³+ax²+b on two extension fields, said elliptic curve encryption processing method comprising: in the computation of an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on said elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on said elliptic curve, a bit value detection step of detecting a combination of each bit value of k and l of binary representation data of said scalar quantities k and l; an initial point computation step of computing a set G′_(t+1) of three initial points on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of said binary representation data of said scalar quantities k and l by using said point P and said point Q; and an iterative computation process step of selecting a computation relation of a set G′_(t) of the next three points based on said set G′_(t+1) of three initial points according to a combination of each bit value of said binary representation data of k and l detected in said bit value detection step and performing a computation process of the next three points in accordance with said computation relation of said set G′_(t), and selecting a computation relation of a set G′_(i) of the next three points based on a set G′_(i+1) of the three computed points and repeatedly performing a computation process of the next three points according to the number of bits of k or l of said binary representation data in accordance with said computation relation of said set G′_(i).
 11. An elliptic curve encryption processing method according to claim 10, wherein, when the high-order bit values of the high orders t to i when each bit of said binary representation data of k and l are k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . L_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, said set G′_(i) of three points is formed of the three points which are selected on the basis of a combination of the bit values (k_(i−1), l_(i−1)) of k and l of said binary representation data from the four points indicated in the expressions below by using said point P and said point Q: m_(i)P+n_(i)Q m_(i)P+(n_(i)+1)Q (m_(i)+1)P+n_(i)Q (m_(i)+1)P+(n_(i)+1) Q, and said initial points are set as the three points which are selected on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of said binary representation data from the four points shown below which are computed on the basis of the above expressions on the basis of m_(t+1)=k_(t+1)=0 and n_(t+1)=l_(t+1)=0 by setting i=t+1: T ₀ [t+1]=O (point at infinity) T ₁ [t+1]=Q T ₂ [t+1]=P T ₃ [t+1]=P+Q.
 12. An elliptic curve encryption processing method according to claim 10, wherein, when the high-order bit values of the high orders t to i when each bit of said binary representation data of k and l is k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, said set G′_(i) of three points is formed of the three points which are selected on the basis of a combination of the bit values (k_(i−1), l_(i−1)) of k and l of said binary representation data from the four points indicated in the expressions below by using said point P and said point Q: m_(i)P+n_(i)Q m_(i)P+(n_(i)+1)Q (m_(i)+1) P+n_(i)Q (m_(i)+1)P+(n_(i)+1)Q, and said iterative computation process step includes computing said set G′i of the next three points on the basis of said set G′_(i) of the three computed points repeatedly to eventually compute a set G′₁ of three points, and in which W=kP+lQ is computed from said set G′₁ of three points.
 13. An elliptic curve encryption processing apparatus using a Montgomery elliptic curve By²=x³+Ax²+X on a prime field, said elliptic curve encryption processing apparatus comprising: a computation processor operable to compute an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on said Montgomery elliptic curve and a point lQ which is a scalar quantity l times as great as a point Q on said Montgomery elliptic curve, wherein said computation processor performs: an initial point computation process of calculating a set G_(t+1) of four initial points on the basis of said point P and said point Q; a bit value detection process of detecting a combination of each bit value of k and l of binary representation data of said scalar quantities k and l; and an iterative computation process of selecting a computation relation of a set G_(t) of the next four points based on said set G_(t+1) of four initial points according to a combination of each bit value of said binary representation data of k and l detected in said bit value detection process and performing a computation process of the next four points in accordance with said computation relation of said set G_(t), and selecting a computation relation of a set G_(i) of the next four points based on a set G_(i+1) of the four computed points and repeatedly performing a computation process of the next four points according to the number of bits of k or l of said binary representation data in accordance with said computation relation of said set G_(i).
 14. An elliptic curve encryption processing apparatus according to claim 13, wherein, when the high-order bit values of the high orders t to i when each bit of said binary representation data of k and l are k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, said set G_(i) of four points is formed of the four points which are indicated in the expressions below by using said point P and said point Q: m_(i) P+n_(i)Q m_(i)P+(n_(i)+1)Q (m_(i)+1)P+n_(i)Q (m_(i)+1)P+(n_(i)+1)Q, and said initial points are set as the four points shown below which are computed on the basis of said expressions on the basis of m_(t+1)=k_(t+1)=0 and n_(t+1)=l_(t+1)=0 by setting i=t+1: T ₀ [t+1]=O (point at infinity) T ₁ [t+1]=Q T ₂ [t+1]=P T ₃[t+1]=P+Q.
 15. An elliptic curve encryption processing apparatus according to claim 13, wherein, when the high-order bit values of the high orders t to i when each bit of said binary representation data of k and l is k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, said set G_(i) of four points is formed of the four points which are indicated in the expressions below by using said point P and said point Q: m_(i)P+n_(i)Q m_(i)P+(n_(i)+1)Q (m_(i)+1)P+n_(i)Q (m_(i)+1)P+(n_(i)+1)Q, and said computation processor is operable to compute said set G_(i) of the next four points repeatedly on the basis of said set G_(i+1) of the four computed points in order to eventually compute a set G₀ of four points, and in which one point which is a constituent of said set G₀ of four points is computed as W=kP+lQ.
 16. An elliptic curve encryption processing apparatus using a Montgomery elliptic curve By²=x³+AX²+x on a prime field, said elliptic curve encryption processing apparatus comprising: a computation processor operable to compute an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on said Montgomery elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on said Montgomery elliptic curve, wherein said computation processor performs: a bit value detection process of detecting a combination of each bit value of k and l of binary representation data of said scalar quantities k and l; an initial point computation process of computing a set G′t+1 of three initial points on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of said binary representation data of said scalar quantities k and l; and an iterative computation process of selecting a computation relation of a set G′_(t) of the next three points based on said set G′_(t+1) of three initial points according to a combination of each bit value of said binary representation data of k and l detected in said bit value detection process and performing a computation process of the next three points in accordance with said computation relation of said set G′_(t), and selecting a computation relation of a set G′_(i) of the next three points based on a set G′_(i+1) of the three computed points and repeatedly performing a computation process of the next three points according to the number of bits of k or l of said binary representation data in accordance with said computation relation of said set G′_(i).
 17. An elliptic curve encryption processing apparatus according to claim 16, wherein, when the high-order bit values of the high orders t to i when each bit of said binary representation data of k and l are k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, said set G′_(i) of three points is formed of the three points which are selected on the basis of a combination of the bit value (k_(t−1), l_(t−1)) of k and l of said binary representation data from the following four points indicated in the expression below by using said point P and said point Q: m_(i) P+n_(i)Q m_(i)P+(n_(i)+1)Q (m_(i)+1)P+n_(i)Q (m_(i)+1)P+(n_(i)+1) Q, and said initial points are set as the three points which are selected on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of said binary representation data from the following four points: T ₀ [t+1]=O (point at infinity) T ₁ [t+1]=Q T ₂ [t+1]=P T ₃ [t+1]=P+A which are the four points computed based on the above relations from m_(t+1)=k_(t+1)=0 and n_(t+1)=l_(t+1)=0 by setting i=t+1.
 18. An elliptic curve encryption processing apparatus according to claim 16, wherein, when the high-order bit values of the high orders t to i when each bit of said binary representation data of k and l are k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, said set G′_(i) of three points is formed of the three points which are selected on the basis of a combination of the high-order bit value (k_(t), l_(t)) of k and l of said binary representation data indicated in the expressions below by using said point P and said point Q: m_(i)P+n_(i)Q m_(i)P+(n_(i)+1)Q (m_(i)+1)P+n_(i)Q (m_(i)+1)P+(n_(i)+1)Q, and said computation processor is operable to compute said set G′_(i) of the next three points from said set G′_(i+1) of the three computed points repeatedly to eventually compute a set G′₁ of three points, and in which W=kP+lQ is computed from said set G′₁ of three points.
 19. An elliptic curve encryption processing apparatus using an elliptic curve y²+xy=x³+ax²+b on two extension fields, said elliptic curve encryption processing apparatus comprising: a computation processor operable to compute an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on said elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on said elliptic curve, wherein said computation processor performs: an initial point computation process of calculating a set G_(t+1) of four initial points on the basis of said point P and said point Q; a bit value detection process of detecting a combination of each bit value of k and l of binary representation data of said scalar quantities k and l; and an iterative computation process of selecting a computation relation of a set G_(t) of the next four points based on said set G_(t+1) of four initial points according to a combination of each bit value of said binary representation data of k and l detected in said bit value detection process and performing a computation process of the next four points in accordance with said computation relation of said set G_(t), and selecting a computation relation of a set G_(i) of the next four points based on a set G_(i+1) of the four computed points and repeatedly performing a computation process of the next four points according to the number of bits of k or l of said binary representation data in accordance with said computation relation of said set G_(i).
 20. An elliptic curve encryption processing apparatus according to claim 19, wherein, when the high-order bit values of the high orders t to i when each bit of said binary representation data of k and l are k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, said set G_(i) of four points is formed of the four points which are indicated in the expressions below by using said point P and said point Q: m_(i)P+n_(i)Q m_(i)P+(n_(i)+1)Q (m_(i)+1)P+n_(i)Q (m_(i)+1)P+(n_(i)+1)Q, and said initial points are set as the four points shown below which are computed on the basis of said expressions on the basis of m_(t+1)=k_(t+1)=0 and n_(t+1)=l_(t+1)=0 by setting i=t+1: T₀ [t+1]=O (point at infinity) T ₁ [t+1]=Q T ₂ [t+1]=P T ₃ [t+1]=P+Q.
 21. An elliptic curve encryption processing apparatus according to claim 19, wherein, when the high-order bit values of the high orders t to i when each bit of said binary representation data of k and l is k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, said set G_(i) of four points is formed of the four points which are indicated in the expressions below by using said point P and said point Q: m_(i)P+n_(i)Q m_(i)P+(n_(i)+1)Q (m_(i)+1)P+n_(i)Q (m_(i)+1)P+(n_(i)+1)Q, and said computation processor is operable to compute said set G_(i) of the next four points repeatedly on the basis of said set G_(i+1) of the four computed points in order to eventually compute a set G₀ of four points, and in which one point which is a constituent of said set G₀ of four points is computed as W=kP+lQ.
 22. An elliptic curve encryption processing apparatus using an elliptic curve y²+xy=x³+ax²+b on two extension fields, said elliptic curve encryption processing apparatus comprising: a computation processor operable to compute an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on said elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on said elliptic curve, wherein said computation processor performs: a bit value detection process of detecting a combination of each bit value of k and l of binary representation data of said scalar quantities k and l; an initial point computation process of computing a set G′_(t+1) of three initial points on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of said binary representation data of said scalar quantities k and l by using said point P and said point Q; and an iterative computation process of selecting a computation relation of a set G′_(t) of the next three points based on said set G′_(t+1) of three initial points according to a combination of each bit value of said binary representation data of k and l detected in said bit value detection process and performing a computation process of the next three points in accordance with said computation relation of said set G′_(t), and selecting a computation relation of a set G′_(i) of the next three points based on a set G′_(i+1) of the three computed points and repeatedly performing a computation process of the next three points according to the number of bits of k or l of said binary representation data in accordance with said computation relation of said set G′_(i).
 23. An elliptic curve encryption processing method according to claim 22, wherein, when the high-order bit values of the high orders t to i when each bit of said binary representation data of k and l are k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, said set G′_(i) of three points is formed of the three points which are selected on the basis of a combination of the bit values (k_(i−1), l_(i−1)) of k and l of said binary representation data from the four points indicated in the expressions below by using said point P and said point Q: m_(i)P+n_(i)Q m_(i)P+(n_(i)+1)Q (m_(i)+1)P+n_(i)Q m_(i)+1)P+(n_(i)+1)Q, and said initial points are set as the three points which are selected on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of said binary representation data from the four points shown below which are computed on the basis of the above expressions on the basis of m_(t+1)=k_(t+1)=0 and n_(t+1)=l_(t+1)=0 by setting i=t+1: T₀ [t+1]=O (point at infinity) T₁ [t+1]=Q T ₂ [t+1]=P T ₃ [t+1]=P+Q.
 24. An elliptic curve encryption processing apparatus according to claim 22, wherein, when the high-order bit values of the high orders t to i when each bit of said binary representation data of k and l is k: (k_(t) . . . k_(o))₂ and l: (l_(t) . . . l_(o))₂ are m_(i)=(k_(t) . . . k_(i))₂ and n_(i)=(l_(t) . . . l_(i))₂, said set G′_(i) of three points is formed of the three points which are selected on the basis of a combination of the bit values (k_(i−1), l_(i−1)) of k and l of said binary representation data from the four points indicated in the expressions below by using said point P and said point Q: m_(i)P+n_(i)Q m_(i)P+(n_(i)+1)Q (m_(i)+1)P+n_(i)Q (m_(i)+1)P+(n_(i)+1)Q, and said computation processor is operable to compute said set G′_(i) of the next three points on the basis of said set G′_(i+1) of the three computed points repeatedly to eventually compute a set G′₁ of three points, and in which W=kP+lQ is computed from said set G′₁ of three points.
 25. A recording medium recorded with a program for executing, on a computer system, an elliptic curve encryption process using a Montgomery elliptic curve By²=x³+Ax²+x on a prime field in which is computed an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on said Montgomery elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on said Montgomery elliptic curve, said program comprising: an initial point computation step of calculating a set G_(t+1) of four initial points on the basis of said point P and said point Q; a bit value detection step of detecting a combination of each bit value of k and l of binary representation data of said scalar quantities k and l; and an iterative computation process step of selecting a computation relation of a set G_(t) of the next four points based on said set G_(t+1) of four initial points according to a combination of each bit value of said binary representation data of k and l detected in said bit value detection step and performing a computation process of the next four points in accordance with said computation relation of said set G_(t), and selecting a computation relation of a set G_(i) of the next four points based on a set G_(i+1) of the four computed points and repeatedly performing a computation process of the next four points according to the number of bits of k or l of said binary representation data in accordance with said computation relation of said set G_(i).
 26. A recording medium recorded with a program for executing, on a computer system, an elliptic curve encryption process using a Montgomery elliptic curve By²=x³+Ax²+x on a prime field in which is computed an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on said Montgomery elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on said Montgomery elliptic curve, said program comprising: a bit value detection step of detecting a combination of each bit value of k and l of binary representation data of said scalar quantities k and l; an initial point computation step of computing a set G′_(t+1) of three initial points on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of said binary representation data of said scalar quantities k and l; and an iterative computation process step of selecting a computation relation of a set G′_(t) of the next three points based on said set G′_(t+1) of three initial points according to a combination of each bit value of said binary representation data of k and l detected in said bit value detection step and performing a computation process of the next three points in accordance with said computation relation of said set G′_(t), and selecting a computation relation of a set G′_(i) of the next three points based on a set G′_(i+1) of the three computed points and repeatedly performing a computation process of the next three points according to the number of bits of k or l of said binary representation data in accordance with said computation relation of said set G′_(i).
 27. A recording medium recorded with a program for executing, on a computer system, an elliptic curve encryption process using an elliptic curve y²+xy=x³+ax²+b on two extension fields in which is computed an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on said elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on said elliptic curve, said program comprising: an initial point computation step of calculating a set G_(t+1) of four initial points on the basis of said point P and said point Q; a bit value detection step of detecting a combination of each bit value of k and l of binary representation data of said scalar quantities k and l; and an iterative computation process step of selecting a computation relation of a set Gt of the next four points based on said set G_(t+1) of four initial points according to a combination of each bit value of said binary representation data of k and l detected in said bit value detection step and performing a computation process of the next four points in accordance with said computation relation of said set G_(t), and selecting a computation relation of a set G_(i) of the next four points based on a set G_(i+1) of the four computed points and repeatedly performing a computation process of the next four points according to the number of bits of k or l of said binary representation data in accordance with said computation relation of said set G_(i).
 28. A recording medium recorded with a program for executing, on a computer system, an elliptic curve encryption process using an elliptic curve y²+xy=x³+ax²+b on two extension fields in which is computed an addition point kP+lQ of a point kP which is a scalar quantity k times as great as a point P on said elliptic curve and of a point lQ which is a scalar quantity l times as great as a point Q on said elliptic curve, said program comprising: a bit value detection step of detecting a combination of each bit value of k and l of binary representation data of said scalar quantities k and l; an initial point computation step of computing a set G′_(t+1) of three initial points on the basis of a combination of the highest-order bit value (k_(t), l_(t)) of k and l of said binary representation data of said scalar quantities k and l by using said point P and said point Q; and an iterative computation process step of selecting a computation relation of a set G′_(t) of the next three points based on said set G′_(t+1) of three initial points according to a combination of each bit value of said binary representation data of k and l detected in said bit value detection step and performing a computation process of the next three points in accordance with said computation relation of said set G′_(t), and selecting a computation relation of a set G′_(i) of the next three points based on a set G′_(i+1) of the three computed points and repeatedly performing a computation process of the next three points according to the number of bits of k or l of said binary representation data in accordance with said computation relation of said set G′_(i). 